Anonymous identification in ad hoc groups

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

Volumn 3027, Issue , 2004, Pages 609-626

  Dodis, Yevgeniy ^a   Kiayias, Aggelos ^b   Nicolosi, Antonio ^a   Shoup, Victor ^a  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHIC PRIMITIVES; EFFICIENT IMPLEMENTATION; FIAT-SHAMIR TRANSFORM; IDENTIFICATION PROTOCOL; IDENTIFICATION SCHEME; RANDOM ORACLE MODEL; STATE-OF-THE-ART SCHEME; STRONG RSA ASSUMPTION;

AUTHENTICATION;

EID: 35048854233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_36     Document Type: Article

References (35)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology - CRYPTO '00, volume 1880 of LNCS, pages 255-270. Springer, 2000.
2. G. Ateniese and B. de Medeiros. Efficient group signatures without trapdoors. In Advances in Cryptology - ASIACRYPT '03, volume 2894 of LNCS, pages 246-268. Springer, 2002.
3. G. Ateniese and G. Tsudik. Some open issues and new directions in group signatures. In Financial Cryptography (FC '99), volume 1648 of LNCS, pages 196-211. Springer, 1999.
4. N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology - EUROCRYPT '97, volume 1233 of LNCS, pages 480-494. Springer, 1997.
5. M. Bellare, M. Fischlin, S. Goldwasser, and S. Micali. Identification protocols secure against reset attacks. In Advances in Cryptology-EUROCRYPT '01, volume 2045 of LNCS, pages 495-511. Springer, 2001.
6. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In Advances in Cryptology - EUROCRYPT '03, volume 2656, pages 630-648. Springer, 2003.
7. J. Benaloh and M. de Mare. One-way accumulators: a decentralized alternative to digital signatures. In Advances in Cryptology - EUROCRYPT '93, volume 765 of LNCS, pages 274-285. Springer, 1993.
8. D. Boneh and M. Franklin. Anonymous authentication with subset queries. In ACM Conference on Computer and Communications Security - CCS '99, pages 113-119. ACM Press, 1999.
9. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In Advances in Cryptology - EUROCRYPT '03, volume 2656 of LNCS, pages 416-432. Springer, 2003.
10. F. Boudot. Efficient proofs that a commited number lies in an interval. In Advances in Cryptology - EUROCRYPT '00, volume 1807 of LNCS, pages 431-444. Springer, 2000.
11. E. Bresson and J. Stern. Efficient revocation in group signatures. In Public Key Cryptography (PKC '01), volume 1992 of LNCS, pages 190-206. Springer, 2001.
12. E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. In CRYPTO 2002, volume 2442 of LNCS, pages 465-480. Springer, 2002.
13. J. Camenisch. Efficient and generalized group signatures. In Advances in Cryptology - EUROCRYPT '97, volume 1233 of LNCS, pages 465-479. Springer, 1997.
14. J. Camenisch and A. Lysyanskaya. An identity escrow scheme with appointed verifiers. In Advances in Cryptology - CRYPTO '01, volume 2139 of LNCS, pages 388-407. Springer, 2001.
15. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and applications to efficient revocation of anonymous credentials. In Advances in Cryptology - CRYPTO '02, volume 2442 of LNCS, pages 61-76. Springer, 2002.
16. J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In Advances in Cryptology - ASIACRYPT '98, volume 1514 of LNCS, pages 160-174. Springer, 1998.
17. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. Full length version of extended abstract in CRYPTO'03, available at: http://shoup.net/papers/, 2003.
18. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology - CRYPTO '97, volume 1294 of LNCS, pages 410-424. Springer, 1997.
19. D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology -EUROCRYPT '91, volume 547 of LNCS, pages 257-265. Springer, 1991.
20. L. Chen and T. P. Pedersen. New group signature schemes (extended abstract). In Advances in Cryptology - EUROCRYPT 94, volume 950 of LNCS, pages 171-181. Springer, 1994.
21. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, CWI and University of Amsterdam, November 1996.
22. R. Cramer, I. B. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology - CRYPTO '94, volume 839 of LNCS, pages 174-187. Springer, 1994.
23. A. De Santis, G. Di Crescenzo, and G. Persiano. Communication-efficient anonymous group identification. In 5th ACM Conference on Computer and Communications Security, pages 73-82. ACM Press, 1998.
24. A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of SZK. In 35th Annual Symposium on Foundations of Computer Science, pages 454-465. IEEE Computer Society Press, 1994.
25. Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup. Anonymous identification in Ad Hoc groups. Full version: http://www.cs.nyu.edu/̃nicolosi/papers/, 2004.
26. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proof of identity. Journal of Cryptology, 1(2):77-94, 1988.
27. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In Advances in Cryptology - CRYPTO '89, volume 435 of LNCS, pages 526-544. Springer, 1989.
28. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology - CRYPTO '86, volume 263 of LNCS, pages 186-194. Springer, 1986.
29. O. Goldreich, S. Micali, and A. Wigderson. Proof that yield nothing bur their validity or all languages in np have zero-knowledge proof systems. Journal of the ACM, 38(3):691-729, 1991.
30. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on computing, 18(1):186-208, 1989.
31. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. In Advances in Cryptology - EUROCRYPT 04, LNCS. Springer, 2004.
32. J. Kilian and E. Petrank. Identity escrow. In Advances in Cryptology - CRYPTO '98, volume 1462 of LNCS, pages 169-185. Springer, 1998.
33. M. Naor. Deniable ring authentication. In Advances in Cryptology - CRYPTO '02, volume 2442 of LNCS, pages 481-498. Springer, 2002.
34. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Advances in Cryptology - ASIACRYPT '01, volume 2248 of LNCS, pages 552-565. Springer, 2001.
35. G. Tsudik and S. Xu. Accumulating composites and improved group signing. In Advances in Cryptology - ASIACRYPT '03, volume 2894 of LNCS, pages 269-286. Springer, 2003.