Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Secret Handshakes from Pairing-Based Key Agreements
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
OpenID 2.0: a platform for user-centric identity management
Proceedings of the second ACM workshop on Digital identity management
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Constructions of truly practical secure protocols using standardsmartcards
Proceedings of the 15th ACM conference on Computer and communications security
VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking
WIMOB '08 Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Modeling energy efficiency in wireless internet communication
Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds
Private Intersection of Certified Sets
Financial Cryptography and Data Security
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Proceedings of the first ACM conference on Data and application security and privacy
Secure set intersection with untrusted hardware tokens
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Privacy-preserving applications on smartphones
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
Public-key encrypted bloom filters with applications to supply chain integrity
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Trust-based anonymous communication: adversary models and routing algorithms
Proceedings of the 18th ACM conference on Computer and communications security
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
TrustedPals: secure multiparty computation implemented with smart cards
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
New proofs for NMAC and HMAC: security without collision-resistance
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Who killed my battery?: analyzing mobile browser energy consumption
Proceedings of the 21st international conference on World Wide Web
Experimenting with fast private set intersection
TRUST'12 Proceedings of the 5th international conference on Trust and Trustworthy Computing
Trustworthy distributed computing on social networks
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
CrowdShare: secure mobile resource sharing
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
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 low 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.