Accumulating composites and improved group signing

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

Volumn 2894, Issue , 2003, Pages 269-286

  Tsudik, Gene ^a   Xu, Shouhuai ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Texas at San Antonio   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; SECURITY OF DATA;

DYNAMIC ACCUMULATORS; EXPONENTIATIONS; GROUP MANAGERS; GROUP SIGNATURE SCHEME; GROUP SIGNATURES; PROVABLY SECURE; RESEARCH TOPICS; STATE OF THE ART;

AUTHENTICATION;

EID: 0344628463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40061-5_16     Document Type: Article

References (36)

1. J. Algesheimer, J. Camenisch, and V. Shoup. Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. Crypto'02.
2. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. Crypto'00.
3. G. Ateniese, D. Song, and G. Tsudik. Quasi-Efficient Revocation of Group Signatures. Financial Crypto'02.
4. G. Ateniese and G. Tsudik. Some Open Issues and New Directions in Group Signatures. Financial Crypto'99.
5. N. Baric and B. Pfitzmann. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. Eurocrypt'97.
6. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. FOCS'97.
7. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction based on General Assumptions. Eurocrypt'03.
8. M. Bellare and P. Rogaway. Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols. ACM CCS'93.
9. F. Boudot. Efficient Proof that a Committed Number lies in an Interval. Eurocrypt'00.
10. E. Bresson and J. Stern. Group Signatures with Efficient Revocation. PKC'01.
11. J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD Thesis. ETH Zurich. 1998.
12. J. Camenisch and A. Lysyanskaya. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. Crypto'02.
13. J. Camenisch and M. Michels. A Group Signature Scheme based on an RSA-variant. Tech. Report RS-98-27, BRIGS. Preliminary version appeared at Asiacrypt'98.
14. J. Camenisch and M. Michels. Separability and Efficiency for Generic Group Signature Schemes (Extended Abstract). Crypto'99.
15. J. Camenisch and M. Stadler. Efficient Group Signature Schemes for Large Groups (Extended Abstract). Crypto'97.
16. D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Nguyen. Paillier's Cryptosystem Revisited. ACM CCS'01.
17. A. Chan, Y. Frankel, and Y. Tsiounis. Each Come - Easy Go Divisible Cash. Eurocrypt'98.
18. L. Chen and T. Pedersen. New Group Signature Schemes. Eurocrypt'94.
19. S. Chaum and E. van Heyst. Group Signatures. Eurocrypt'91.
20. D. Chaum and T. P. Pedersen. Wallet Databases with Observers. Crypto'92.
21. D. Coppersmith. Finding a Small Root of a Bivariate Integer Equation; factoring with high bits known. Eurocrypt'96.
22. D. Coppersmith. Personal Communication. Jan. 2003.
23. I. Damgard. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Eurocrypt'00.
24. I. Damgard and E. Fujisaki. An Integer Commitment Scheme Based on Groups with Hidden Order. Asiacrypt'02.
25. T. ElGamal, A Public-Key Cryptosystem and a Signature Scheme Based on the Discrete Logarithm, IEEE Transactions of Information Theory, 31(4), 1985, pp 469-472.
26. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Crypto'86.
27. E. Fujisaki and T. Okamoto. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. Crypto'97.
28. R. Gennaro. An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem. Crypto'00.
29. R. Gennaro, H. Krawczyk, and T. Rabin. RSA-Based Undeniable Signatures. J. Cryptology, (13)4, 2000, pp 397-416.
30. J. Kilian and E. Petrank. Identity Escrow. Crypto'98.
31. P. MacKenzie and M. Reiter. Two-Party Generation of DSA Signatures. Crypto'01.
32. P. Paillier. Public Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt'99.
33. C. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology 4(3) 161-174, 1991.
34. D. Song. Practical Forward Secure Group Signature Schemes. ACM CCS'01.
35. Y. Tsiounis and M. Yung. On the Security of ElGamal Based Encryption. PKC'98.
36. G. Tsudik and S. Xu. Accumulating Composites and Improved Group Signing. Extended version of this paper available at http://eprint.iacr.org/2003/112/.