Privacy-Preserving Relationship Path Discovery in Social Networks

  • Ghita Mezzour
  • Adrian Perrig
  • Virgil Gligor
  • Panos Papadimitratos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5888)


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.


Social Network Social Networking Site Token Propagation Homomorphic Encryption Computation Overhead 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
    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)Google Scholar
  3. 3.
    Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of ACM SIGMOD international conference on Management of data (June 2003)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Carminati, B., Ferrari, E., Perego, A.: Private relationships in social networks. In: International Conference on Data Engineering Workshops (2007)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Freedman, M.J., Nicolosi, A.: Efficient private techniques for verifying social proximity. In: Proceedings of International Workshop on Peer-to-Peer Systems (2007)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Kissner, L., Song, D.: Privacy preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)Google Scholar
  12. 12.
    Laurie, B.: Apres: A system for anonymous presence (2004),
  13. 13.
    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)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: IEEE Symposium on Security and Privacy (May 2009)Google Scholar
  16. 16.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ghita Mezzour
    • 1
  • Adrian Perrig
    • 1
  • Virgil Gligor
    • 1
  • Panos Papadimitratos
    • 2
  1. 1.Carnegie Mellon UniversityPittsburgh
  2. 2.EPFLLausanneSwitzerland

Personalised recommendations