A practical and provably secure coalition-resistant group signature scheme

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

Volumn 1880, Issue , 2000, Pages 255-270

  Ateniese, Giuseppe ^a   Camenisch, Jan ^b   Joye, Marc ^c   Tsudik, Gene ^d  

^a Johns Hopkins University   (United States)

^b IBM RESEARCH ZURICH   (Switzerland)

^c GEMPLUS   (France)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Coalitionresistance; Group signature schemes; Identity escrow; Provable security; Revocable anonymity; Strong RSA assumption

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY;

COALITIONRESISTANCE; GROUP SIGNATURE SCHEME; IDENTITY ESCROW; PROVABLE SECURITY; REVOCABLE ANONYMITY; STRONG RSA ASSUMPTION;

NETWORK SECURITY;

EID: 84921018856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_16     Document Type: Conference Paper

References (21)

1. N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology-EUROCRYPT’97, vol. 1233 of LNCS, pp. 480-494, Springer-Verlag, 1997.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communication Security, pp. 62-73, ACMPress, 1993.
3. D. Boneh. The decision Diffie-Hellman problem. In Algorithmic Number Theory (ANTS-III), vol. 1423 of LNCS, pp. 48-63, Springer-Verlag, 1998.
4. S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, Centrum voor Wiskunde en Informatica, April 1993.
5. J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In Advances in Cryptology-ASIACRYPT’98, vol. 1514 of LNCS, pp. 160-174, Springer-Verlag, 1998.
6. J. Camenisch and M. Michels. A group signature scheme based on an RSA-variant. Technical Report RS-98-27, BRICS, University of Aarhus, November 1998. An earlier version appears in [CM98a].
7. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology-EUROCRYPT’99, vol. 1592 of LNCS, pp. 107-122, Springer-Verlag, 1999.
8. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In Advances in Cryptology-CRYPTO’99, vol. 1666 of LNCS, pp. 413-430, Springer-Verlag, 1999.
9. L. Chen and T.P. Pedersen. New group signature schemes. In Advances in Cryptology-EUROCRYPT’94, vol. 950 of LNCS, pp. 171-181, 1995.
10. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology-CRYPTO’97, vol. 1296 of LNCS, pp. 410-424, Springer-Verlag, 1997.
11. J. Camenisch. Group signature schemes and payment systems based on the discrete logarithm problem. PhD thesis, vol. 2 of ETH Series in Information Security an Cryptography, Hartung-Gorre Verlag, Konstanz, 1998. ISBN 3-89649-286-1.
12. D. Coppersmith. Finding a small root of a bivariatre interger equation; factoring with high bits known. In Advances in Cryptology-EUROCRYPT ’96, volume 1070 of LNCS, pages 178-189. Springer Verlag, 1996.
13. D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology-EUROCRYPT’91, vol. 547 of LNCS, pp. 257-265, Springer-Verlag, 1991.
14. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6): 644-654, 1976.
15. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology-CRYPTO’97, vol. 1297 of LNCS, pp. 16-30, Springer-Verlag, 1997.
16. E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In Advances in Cryptology-EUROCRYPT’ 98, vol. 1403 of LNCS, pp. 32-46, Springer-Verlag, 1998.
17. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology-CRYPTO’86, vol. 263 of LNCS, pp. 186-194, Springer-Verlag, 1987.
18. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
19. J. Kilian and E. Petrank. Identity escrow. In Advances in Cryptology-CRYPTO’98, vol. 1642 of LNCS, pp. 169-185, Springer-Verlag, 1998.
20. A. Lysyanskaya and Z. Ramzan. Group blind digital signatures: A scalable solution to electronic cash. In Financial Cryptography (FC’98), vol. 1465 of LNCS, pp. 184-197, Springer-Verlag, 1998.
21. C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.