STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Enhancing privacy and trust in electronic communities
Proceedings of the 1st ACM conference on Electronic commerce
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Key Distribution Systems Based on Identification Information
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Secret Handshakes from Pairing-Based Key Agreements
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Brief announcement: secret handshakes from CA-oblivious encryption
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Concealing complex policies with hidden credentials
Proceedings of the 11th ACM conference on Computer and communications security
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Link privacy in social networks
Proceedings of the 17th ACM conference on Information and knowledge management
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
Efficient Robust Private Set Intersection
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Private Intersection of Certified Sets
Financial Cryptography and Data Security
Private Mutual Authentication and Conditional Oblivious Transfer
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Relationship identification for social network discovery
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Common Friends Discovery with Privacy and Authenticity
IAS '09 Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 01
Securing traceability of ciphertexts: towards a secure software key escrow system
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Beyond secret handshakes: affiliation-hiding authenticated key exchange
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Taming big brother ambitions: more privacy for secret handshakes
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Credential authenticated identification and key exchange
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Using friendship ties and family circles for link prediction
SNAKDD'08 Proceedings of the Second international conference on Advances in social network mining and analysis
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Affiliation-hiding key exchange with untrusted group authorities
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Link Mining: Models, Algorithms, and Applications
Link Mining: Models, Algorithms, and Applications
(If) size matters: size-hiding private set intersection
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Practical affiliation-hiding authentication from improved polynomial interpolation
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Computing communities in large networks using random walks
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient set operations in the presence of malicious adversaries
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Cryptographic treatment of private user profiles
FC'11 Proceedings of the 2011 international conference on Financial Cryptography and Data Security
Privacy-preserving applications on smartphones
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
Cachet: a decentralized architecture for privacy preserving social networking with caching
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications
Proceedings of the 29th Annual Computer Security Applications Conference
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 use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common problem occurs when two unfamiliar users, in the process of establishing social relationships, want to assess their social proximity by discovering mutual contacts. In this paper, we introduce Private Contact Discovery, a novel cryptographic primitive that lets two users, on input their respective contact lists, learn their common contacts (if any), and nothing else. We present an efficient and provably secure construction, that (i) prevents arbitrary list manipulation by means of contact certification, and (ii) guarantees user authentication and revocability. Following a rigorous cryptographic treatment of the problem, we define the privacy-protecting contact-hiding property and prove it for our solution, under the RSA assumption in the Random Oracle Model (ROM). We also show that other related cryptographic techniques, such as Private Set Intersection and Secret Handshakes, are unsuitable in this context. Experimental analysis attests to the practicality of our technique, which achieves computational and communication overhead (almost) linear in the number of contacts.