Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Do i know you? - Efficient and privacy-preserving common friend-finder protocols and applications

: Nagy, M.; De Cristofaro, E.; Dmitrienko, A.; Asokan, N.; Sadeghi, A.-R.


Payne, C.N. ; Association for Computing Machinery -ACM-:
29th Annual Computer Security Applications Conference, ACSAC 2013
New York: ACM, 2013
ISBN: 978-145-032-015-3
Annual Computer Security Applications Conference (ACSAC) <29, 2013, New Orleans/La.>
Fraunhofer SIT ()

The increasing penetration of Online Social Networks (OSNs) prompts the need for effectively accessing and utilizing social networking information. In numerous applications, users need to make trust and/or access control decisions involving other (possibly stranger) users, and one important factor is often the existence of common social relationships. This motivates the need for secure and privacy-preserving techniques allowing users to assess whether or not they have mutual friends. This paper introduces the Common Friends service, a framework for finding common friends which protects privacy of non-mutual friends and guarantees authenticity of friendships. First, we present a generic construction that reduces to secure computation of set intersection, while ensuring authenticity of announced friends via bearer capabilities. Then, we propose an efficient instantiation, based on Bloom filters, that only incurs a constant number of public-key operations and appreciably l ow communication overhead. Our software is designed so that developers can easily integrate Common Friends into their applications, e.g., to enforce access control based on users' social proximity in a privacy-preserving manner. Finally, we showcase our techniques in the context of an existing application for sharing (tethered) Internet access, whereby users decide to share access depending on the existence of common friends. A comprehensive experimental evaluation attests to the practicality of proposed techniques. Copyright 2013 ACM.