A Flexible Framework for Secret Handshakes
نویسندگان
چکیده
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 onetime 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 stepby-step construction of the framework, this paper provides a thorough security analysis and illustrates two concrete framework instantiations.
منابع مشابه
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...
متن کامل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 with Revocation Support
Secret Handshake is becoming an ever more popular research subject in the field of privacypreserving authentication protocols. Revocation of credentials in Secret Handshakes is a difficult challenge, as it mixes the conflicting requirements of tracing revoked users and of the untraceability and unlinkability of legitimate protocol players. The schemes proposed in the literature are either limit...
متن کاملOptionally Identifiable Private Handshakes
It is now a trend that Internet users are increasingly concerned about individual privacy, and as a result numerous privacy-preserving authentication techniques have been proposed. In this paper, we propose the concept of private handshakes with optional identifiability, which allows the two users in a handshake deciding real time to either proceed their interaction as secret handshake or as pr...
متن کامل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...
متن کامل