Abstract
New paradigms for the Internet architecture evolution towards a data dissemination oriented have been largely proposed. Scott Shenker et al. (SIGCOMM 2007) define the basic principles desirable for a dissemination network, but they do not suggest how to realize them. We introduce the Secure Pseudonymous Access (SPA), an access protocol suitable for every dissemination network. The main goal is to couple QoS constraints in terms of data reliability and secure access with easiness of service use, by removing most of administrative and user initialization burdens. The key issue is the user traceability, i.e. the possibility to tie together (in a provable way) the actions performed by the same user entity, along with pieces of data uploaded into the network to be shared with others. The signalling procedures of SPA are defined and the security issues are discussed; finally we describe a test bed implementation of SPA and give an estimate of procedure complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
It is well known that if \({H(\cdot)}\) is collision resistant and \(\Uppi\) is UF-CMA then the signing function defined in (3.1) is UF-CMA in the random oracle model.
References
Jacobson, V.: If a Clean Slate is the solution what was the problem? Stanford “Clean Slate” Seminar (2006).
Stoica, I., Adkins, D., Zhuang, S., Shenker, S., Surana, S.: Internet indirection infrastructure. In: SIGCOMM ’02: Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (2002)
Moskowitz, R., Nikander, P.: Host identity protocol architecture. Internet-Draft, IETF, Apr 2006
Walfish, M., Stribling, J., Krohn, M., Balakrishnan, H., Morris, R., Shenker S.: Middleboxes no longer considered harmful. In: OSDI’04: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, pp. 15–15. USENIX Association (2004)
Jonsonn, A., Folk, M., Ahlgren, B.: The split naming/forwarding network architecture. In: SNCNW ’06: Proceedings of Swedish National Computer Networking Workshop (SNCNW), 2006
Koponen, T., Chawla, M., Chun, B.G., Ermolinskiy, A., Kim, K.H., Shenker, S., Stoica, I.: A data-oriented (and beyond) network architecture. SIGCOMM Comput. Commun. Rev. (2007)
Chaum, D., Antwerpen, H.V.: Undeniable signatures. In: CRYPTO89, pp. 212–217. Springer-Verlag (1990)
Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall/CRC Press (2008)
Evans, D., Beresford, A.R., Burbridge, T., Soppera, A.: Context-derived pseudonyms for protection of privacy in transport middleware and applications. In: PERCOMW ’07: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)
Dang, X., Zhang, Y.: Hierarchical pseudonym-based signature scheme and self-generated pseudonym system in Ad Hoc networks. In: ICWMC ’08: Proceedings of the 2008 the Fourth International Conference on Wireless and Mobile Communications,IEEE Computer Society, Washington, (2008).
Rowstron, A.I.T., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware ’01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg. Springer-Verlag (2001)
USA Rice University, Houston. Pastry implementation, http://www.freepastry.org. Accessed May 2008.
Cryptographic benchmark. http://www.cryptopp.com/benchmarks.html (2008). Accessed May 2008
Acknowledgements
The topic of this paper includes description of results of a research project carried out by INFOCOM Dept, “Sapienza” University of Rome on behalf of (and funded by) Telecom Italia S.p.A., who reserve all proprietary rights in any process, procedure, algorithm, article of manufacture, or other results of the project herein described. The first author is thankful to Daniele Venturi for helpful discussions on the write-up of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Italia Srl
About this chapter
Cite this chapter
Del Grosso, A., Listanti, M., Baiocchi, A., D’Ambrosio, M. (2011). Secure Pseudonymous Access to Overlay Data Dissemination Network. In: Salgarelli, L., Bianchi, G., Blefari-Melazzi, N. (eds) Trustworthy Internet. Springer, Milano. https://doi.org/10.1007/978-88-470-1818-1_3
Download citation
DOI: https://doi.org/10.1007/978-88-470-1818-1_3
Published:
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-1817-4
Online ISBN: 978-88-470-1818-1
eBook Packages: EngineeringEngineering (R0)