Abstract
As social networks sites continue to proliferate and are being used for an increasing variety of purposes, the privacy risks raised by the full access of social networking sites over user data become uncomfortable. A decentralized social network would help alleviate this problem, but offering the functionalities of social networking sites is a distributed manner is a challenging problem. In this paper, we provide techniques to instantiate one of the core functionalities of social networks: discovery of paths between individuals. Our algorithm preserves the privacy of relationship information, and can operate offline during the path discovery phase. We simulate our algorithm on real social network topologies.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
foaf-o-matic, http://www.foaf.com/
Ackermann, M., Hymon, K., Ludwig, B., Wilhelm, K.: Helloworld: An open source, distributed and secure social network. In: W3C Workshop on the Future of Social Networking (January 2009)
Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of ACM SIGMOD international conference on Management of data (June 2003)
Baden, R., Bender, A., Spring, N., Bhattacharjee, B., Starin, D.: Persona: An online social network with user-defined privacy. In: Proceedings of ACM SIGCOMM (August 2009)
Carminati, B., Ferrari, E., Perego, A.: Private relationships in social networks. In: International Conference on Data Engineering Workshops (2007)
Domingo-Ferrer, J.: A public-key protocol for social networks with private relationships. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds.) MDAI 2007. LNCS (LNAI), vol. 4617, pp. 373–379. Springer, Heidelberg (2007)
Freedman, M.J., Nicolosi, A.: Efficient private techniques for verifying social proximity. In: Proceedings of International Workshop on Peer-to-Peer Systems (2007)
Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Garriss, S., Kaminsky, M., Freedman, M.J., Karp, B., Mazieres, D., Yu, H.: RE: Reliable email. In: Symposium on Networked Systems Design and Implementation (NSDI) (May 2006)
Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 146–162. Springer, Heidelberg (2008)
Kissner, L., Song, D.: Privacy preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)
Laurie, B.: Apres: A system for anonymous presence (2004), http://www.apache-ssl.org/apres.pdf/
Lucas, M., Borisov, N.: Flybynight: mitigating the privacy risks of social networking. In: Proceedings of ACM workshop on Privacy in the Electronic Society (WPES) (October 2008)
Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the ACM SIGCOMM conference on Internet measurement (IMC) (2007)
Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: IEEE Symposium on Security and Privacy (May 2009)
Popescu, B.C., Crispo, B., Tanenbaum, A.S.: Safe and private data sharing with turtle: Friends team-up and beat the system. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2004. LNCS, vol. 3957, pp. 221–230. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mezzour, G., Perrig, A., Gligor, V., Papadimitratos, P. (2009). Privacy-Preserving Relationship Path Discovery in Social Networks. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds) Cryptology and Network Security. CANS 2009. Lecture Notes in Computer Science, vol 5888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10433-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-10433-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10432-9
Online ISBN: 978-3-642-10433-6
eBook Packages: Computer ScienceComputer Science (R0)