Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
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
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Private Intersection of Certified Sets
Financial Cryptography and Data Security
Privacy-Preserving Policy-Based Information Transfer
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Private Mutual Authentication and Conditional Oblivious Transfer
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
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
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
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
A flexible framework for secret handshakes
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Group secret handshakes or affiliation-hiding authenticated group key agreement
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Practical affiliation-hiding authentication from improved polynomial interpolation
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Affiliation-hiding authentication with minimal bandwidth consumption
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Privacy of Community Pseudonyms in Wireless Peer-to-Peer Networks
Mobile Networks and Applications
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications
Proceedings of the 29th Annual Computer Security Applications Conference
Hi-index | 0.00 |
Affiliation-Hiding Authenticated Key Exchange (AH-AKE) protocols enable two distrusting users, being in possession of membership credentials for some group, to establish a secure session key without leaking any information about this group to non-members. In practice, users might be members of several groups, and such protocols must be able to generate session keys between users who have one or more groups in common. Finding efficient solutions for this group discovery problem has been considered an open research problem, inherent to the practical deployment of these protocols. We show how to solve the privacy-preserving group discovery problem with linear computational and communication complexity, namely O(n) complexity where n is the number of groups per user. Our generic solution is based on a new primitive -- Index-Hiding Message Encoding (IHME), for which we provide definitions and an unconditionally secure construction. Additionally, we update the syntax and the security model of AH-AKE protocols to allow multiple input groups per participant and session. Furthermore, we design a concrete multi-group AH-AKE protocol by applying IHME to a state-of-the-art single-group scheme.