Gene Tsudik
Shouhuai Xu
ABSTRACT
Secret handshakes offer anonymous and unobservable authentication and serve as an important tool in the arsenal of privacy-preserving techniques. Prior research focused on 2-party secret handshakes with one-time credentials. This paper breaks new ground on two accounts: (1) we obtain secure and efficient secret handshakes with reusable credentials, and (2) we provide the first treatment of multi-party secret handshakes.
- D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H. Wong. Secret Handshakes from Pairing-Based Key Agreements, IEEE Symposium on Security and Privacy 2003. Google Scholar
Digital Library
- C. Castelluccia, S. Jarecki, and G. Tsudik. Secret Handshakes from CA-Oblivious Encryption, ASIACRYPT 2004.Google ScholarCross Ref
- S. Xu and M. Yung. k-anonymous Secret Handshakes with Reusable Credentials, ACM CCS 2004. Google ScholarDigital Library
- G. Tsudik and S. Xu, A Flexible Framework for Secret Handshakes, Cryptology ePrint Archive: Report 2005/034.Google Scholar
Index Terms
- Brief announcement: a flexible framework for secret handshakes
Recommendations
A flexible framework for secret handshakes
PET'06: Proceedings of the 6th international conference on Privacy Enhancing TechnologiesIn 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 ...
Brief announcement: secret handshakes from CA-oblivious encryption
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computingSecret handshake protocols were recently introduced by Balfanz, et al. [1] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member cannot tell, by engaging in the handshake protocol, ...
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in CryptologyWe introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one ...
Comments