A flexible framework for secret handshakes: (Multi-party anonymous and un-observable authentication)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4258 LNCS, Issue , 2006, Pages 295-315

  Tsudik, Gene ^a   Xu, Shouhuai ^b  

^a Irvine   (United States)

^b Science Building   (United States)

Author keywords

Anonymity; Credential systems; Key management; Privacy preservation; Secret handshakes; Unobservability

Indexed keywords

COMMUNICATION CHANNEL; CREDENTIAL SYSTEMS; CRYPTOGRAPHIC TECHNIQUES; FLEXIBLE FRAMEWORK; KEY MANAGEMENT; NATURAL EXTENSION; PAPER BREAK; PRIVACY PRESERVING; REUSABLE CREDENTIALS; SECRET HANDSHAKE; SECURITY ANALYSIS; STEP-BY-STEP; UNOBSERVABILITY; UNOBSERVABLE;

AUTHENTICATION; DATA PRIVACY; NETWORK PROTOCOLS; NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 49049098105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11957454_17     Document Type: Conference Paper

References (36)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Proc. CRYPTO 2000, pages 255-270. Springer, 2000. Lecture Notes in Computer Science No. 1880.
2. G. Ateniese and G. Tsudik. Some Open Issues and New Directions in Group Signatures. In Financial Cryptography'99. Lecture Notes in Computer Science No. 1880.
3. D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H. Wong. Secret handshakes from pairing-based key agreements. In 24th IEEE Symposium on Security and Privacy, May 2003.
4. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 614-629. Springer, 2003.
5. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Proc. EUROCRYPT 2000, pages 139-155. Springer, 2000. Lecture Notes in Computer Science No. 1807.
6. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62-73, Fairfax, 1993. ACM.
7. M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: The case of dynamic groups. Cryptology ePrint Archive, Report 2004/077, 2004. http://eprint.iacr.org/.
8. C. Boyd, W. Mao, and K. Paterson. Deniable authenticated key establishment for internet protocols.
9. R. Bradshaw, J. Holt, and K. Seamons. Concealing complex policies with hidden credentials. In Proceedings of the 11th ACM conference on Computer and communications security (CCS'04), pages 146-157. ACM Press, 2004.
10. E. Bresson, O. Chevassut, and D. Pointcheval. Dynamic group Diffie-Hellman key exchange under standard assumptions. In L. R. Knudsen, editor, Proc. of Eurocrypt 02, volume 2332 of LNCS, page 321-336.
11. M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In A. D. Santis, editor, Proc. EUROCRYPT 94, pages 275-286. Springer, 1994. Lecture Notes in Computer Science No. 950.
12. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In M. Yung, editor, Proc. CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 61-76.
13. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B.S. Kaliski Jr., editor, Proc. CRYPTO 1997, volume 1294 of Lecture Notes in Computer Science, pages 410-424. Springer-Verlag, 1997.
14. C. Castelluccia, S. Jarecki, and G. Tsudik. Secret handshakes from ca-oblivious encryption. In Advances in Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 293-307. Springer, 2004.
15. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24:84-88, Feb. 1981.
16. D. Chaum. Blind signatures for untraceable payments. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proc. CRYPTO 82, pages 199-203.
17. D. Chaum and E. V. Heyst. Group signatures. In D.W. Davies, editor, Advances in Cryptology - Eurocrypt '91, pages 257-265, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science No. 547.
18. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22:644-654, Nov. 1976.
19. J. Douceur. The sybil attack. In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'01), pages 251-260, 2002. Springer-Verlag.
20. M. Fischer, N. Lynch, and M. Patterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985.
21. J. Katz and M. Yung. Scalable protocols for authenticated group key exchange. In D. Boneh, editor, Proc. CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 110-125. Springer-Verlag, 2002.
22. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 571-589. Springer, 2004.
23. A. Kiayias and M. Yung. Group signatures: Provable security, efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076, 2004. http://eprint.iacr.org/.
24. H. Krawczyk. Sigma: The 'sign-and-mac' approach to authenticated diffie-hellman and its use in the ike-protocols. In D. Boneh, editor, Proc. CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 400-425. Springer-Verlag, 2002.
25. N. Li, W. Du, and D. Boneh. Oblivious signature-based envelope. In Proceedings of 22nd ACM Symposium on Principles of Distributed Computing (PODC), pages 182-189. ACM, 2003.
26. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In J. Kilian, editor, Proc. CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 41-62. Springer-Verlag, 2001.
27. M. Naor. Deniable ring authentication. In M. Yung, editor, Proc. CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 481-498. 2002.
28. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Advances in Cryptology-ASIACRYPT '2001, pages 552-565.
29. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In Proceedings of the Symposium on Cryptography and Information Security (SCIS), 2002.
30. M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Trans. on Parallel and Distributed Systems, 11(8):769-780, 2000.
31. Y. Sun and K. Liu. Securing dynamic membership information in multicast communications. In IEEE Infocom'04.
32. G. Tsudik and S. Xu. A Flexible Framework for Secret Handshakes. Full version of the present paper (available from the authors).
33. D. Wallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures. Internet Draft, Sept. 1998.
34. C. Wong, M. Gouda, and S. Lam. Secure group communication using key graphs. IEEE/ACM Transactions on Networking (Preliminary version in SIGCOMM'98), 8, 2000.
35. S. Xu. On the security of group communication schemes based on symmetric key cryptosystems. In Proceedings of the Third ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), 2005.
36. S. Xu and M. Yung. k-anonymous secret handshakes with reusable credentials. In Proceedings of the 11th ACM conference on Computer and communications security (CCS'04), pages 158-167. ACM Press, 2004.