Secret Handshakes from Pairing-Based Key Agreements
نویسندگان
چکیده
Consider a CIA agent who wants to authenticate herself to a server, but does not want to reveal her CIA credentials unless the server is a genuine CIA outlet. Consider also that the CIA server does not want to reveal its CIA credentials to anyone but CIA agents – not even to other CIA servers. In this paper we first show how pairing-based cryptography can be used to implement such secret handshakes. We then propose a formal definition for secure secret handshakes, and prove that our pairing-based schemes are secure under the Bilinear Diffie-Hellman assumption. Our protocols support role-based group membership authentication, traceability, indistinguishability to eavesdroppers, unbounded collusion resistance, and forward repudiability. Our secret-handshake scheme can be implemented as a TLS cipher suite. We report on the performance of our preliminary Java implementation.
منابع مشابه
A New Unlinkable Secret Handshakes Scheme Based on Zss
Secret handshakes (SH) scheme is a key agreement protocol between two members of the same group. Under this scheme two members share a common key if and only if they both belong to the same group. If the protocol fails none of the parties involved get any idea about the group affiliation of the other. Moreover if the transcript of communication is available to a third party, she/he does not get...
متن کاملCryptanalysis of Efficient Unlinkable Secret Handshakes for Anonymous Communications
Several unlinkable secret handshakes schemes have been proposed in recent years. As performing the successful secret handshakes is essentially equivalent to computing a common key between two interactive members of the same group. Therefore secret handshakes scheme is a key agreement protocol between two members of the same group. So it is necessary for a secret handshakes scheme to fulfill sec...
متن کاملSecret Handshakes based on Shortened Versions of DSS
Balfanz et al. in 2003 introduced secret handshakes as mechanisms designed to prove group membership and share a secret key between two fellow group members. A secret handshake protocol allows two users to mutually verify another’s authenticity without revealing their own identity. In a secret handshake Verification if the verification succeeds the users may compute a common shared key for furt...
متن کاملA New Secret Handshakes Scheme with Dynamic Matching Based on Zss
Balfanz et al. in 2003, introduced the primitive secret handshakes (SH) as a two party protocol together with a notion of roles and implements it using pairing based cryptography, the scheme allows two parties to make a match (authentication & verification) and derive a shared common session key if and only if they belong to same group. If the parties do not belong to the same group, they canno...
متن کاملA Flexible Framework for Secret Handshakes or: How to Achieve Multi-Party Interactive Anonymous Mutual Authentication
In the society increasingly concerned with the erosion of privacy, privacy-preserving techniques are becoming very important. Secret handshakes offer anonymous and unobservable authentication and serve as an important tool in the arsenal of privacy-preserving techniques. Relevant prior research focused on 2-party secret handshakes with one-time credentials, whereby two parties establish a secur...
متن کامل