Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Some Open Issues and New Directions in Group Signatures
FC '99 Proceedings of the Third International Conference on Financial Cryptography
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Secret Handshakes from Pairing-Based Key Agreements
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Oblivious signature-based envelope
Proceedings of the twenty-second annual 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
On the security of group communication schemes based on symmetric key cryptosystems
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Authenticated key exchange secure against dictionary attacks
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A novel and efficient unlinkable secret handshakes scheme
IEEE Communications Letters
PPAA: peer-to-peer anonymous authentication
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
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
Taming big brother ambitions: more privacy for secret handshakes
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
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
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
Secret handshakes from ID-based message recovery signatures: A new generic approach
Computers and Electrical Engineering
Secret handshake scheme with request-based-revealing
EuroPKI'11 Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications
Secret handshake scheme with request-based-revealing
Computers & Mathematics with Applications
Privacy of Community Pseudonyms in Wireless Peer-to-Peer Networks
Mobile Networks and Applications
Attacks on Confidentiality of Communications Between Stranger Organizations
International Journal of Knowledge-Based Organizations
Private mutual authentications with fuzzy matching
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
In the society increasingly concerned with the erosion of privacy, privacy-preserving techniques are becoming very important. This motivates research in cryptographic techniques offering built-in privacy. A secret handshake is a protocol whereby participants establish a secure, anonymous and unobservable communication channel only if they are members of the same group. This type of “private” authentication is a valuable tool in the arsenal of privacy-preserving cryptographic techniques. Prior research focused on 2-party secret handshakes with one-time credentials. This paper breaks new ground on two accounts: (1) it shows how to obtain secure and efficient secret handshakes with reusable credentials, and (2) it represents the first treatment of group (or multi-party) secret handshakes, thus providing a natural extension to the secret handshake technology. An interesting new issue encountered in multi-party secret handshakes is the need to ensure that all parties are indeed distinct. (This is a real challenge since the parties cannot expose their identities.) We tackle this and other challenging issues in constructing GCD – a flexible framework for secret handshakes. The proposed GCD framework lends itself to many practical instantiations and offers several novel and appealing features such as self-distinction and strong anonymity with reusable credentials. In addition to describing the motivation and step-by-step construction of the framework, this paper provides a thorough security analysis and illustrates two concrete framework instantiations.