How to convert any digital signature scheme into a group signature scheme

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

Volumn 1361, Issue , 1998, Pages 177-190

  Petersen, Holger ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b NONE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

DIGITAL SIGNATURE SCHEMES; GROUP SIGNATURE SCHEME; GROUP SIGNATURES; SIGN MESSAGES; THRESHOLD GROUP SIGNATURE;

AUTHENTICATION;

EID: 84957002815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028168     Document Type: Conference Paper

References (19)

1. S. Brands, “Untraceable Off-Line Cash in Wallets with Observers” Lecture Notes in Computer Science 773, Advances in Cryptology: Proc. Crypto ‘93, Springer, (1994), pp. 302-318.
2. J. Cameniscb, “‘Efficient and Generalized Group signatures”‘, to appear in Lecture Notes in Computer Science, Advances in Cryptology: Proc. Eurocrypt’ 97, Springer, (1997), 12 pages.
3. D. Chaum, E. van Heijst, “Group signatures”, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt ‘91, Springer, (1992), pp. 257-265.
4. D. Chaum, T. Pedersen, “Wallet databases with observers”, Lecture Notes in Computer Science 740, Advances in Cryptology: Proc. Crypto’92, (1993), pp. 89-105.
5. L. Chen, T. Pedersen, “New Group Signature Schemes”, Lecture Notes in Computer Science 950, Advances in Cryptology: Proc. Eurocrypt’94, Springer, (1995), pp. 163-173.
6. L. Chen, T. Pedersen, “On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity”, Lecture Notes in Computer Science 921, Advances in Cryptology: Proc. Eurocrypt’95, Springer, (1995), pp. 39-49.
7. R. Cramer, I. Damgard, B. Schoenrnakers, “Proofs of Partial Knowledge and Simplifies Designs of Witness Hiding Protocols”, Lecture Notes in Computer Science 839, Advances in Cryptology: Proc. Crypto’94, Springer, (1994), pp. 174-187.
8. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, Vol. IT-30, No. 4, July, (1985), pp. 469-472.
9. U. Feige, A. Shamir, “‘Witness indistinguishable and witness hiding protocols” ‘, Proc. of the 22nd Annual ACM Symposium on the Theory of Computing, ACM Press, (1990), pp. 416-426.
10. A. Fiat, A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems”, Advances in Cryptology: Proc. Crypto’86, Lecture Notes in Computer Science 263, Springer, (1987), pp. 186-194.
11. Y. Frankel, Y. Tsiounis, M. Yung, “Indirect Discourse Proofs”: Achieving Efficient Fair Off-Line E-Cash”, Lecture Notes in Computer Science 1163, Advances in Cryptology: Proc. Asiacrypt’96, Springer, (1996), pp. 286-300.
12. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, “Robust Threshold DSS Signatures”, Advances in Cryptology: Proc. Eurocrypt’96, Lecture Notes in Computer Science 1070, Springer, (1996), pp. 354-371.
13. S. Goldwasser, S. Micali, R. Rivest, “A secure digital signature scheme”, SIAM Journal on Computing, Vol. 17, 2, (1988), pp. 281-308.
14. S.J. Kim, S.J. Park, D.H. Won, “Convertible Group Signatures”, Lecture Notes in Computer Science 1163, Advances in Cryptology: Proc. Asiacrypt’ 96, (1996), pp. 311-321.
15. M. Michels, “Comments on some group signature schemes”, Technical Report TR-96-03, University of Technology Chemnitz-Zwickau, November, (1996), 4 pages, available at http://www.tu-chemnitz.de/~hpe/techrep.html.
16. T. Okamoto, “Provable secure and practical identification schemes and corresponding signature schemes”, Lecture Notes in Computer Science 740, Advances in Cryptology: Proc. Crypto ‘92, (1993), pp. 31-53.
17. C. Park, K. Kurosawa, “New E1Gamal Type Threshold Digital Signature Scheme”, IEICE Trans. Fundamentals. Vol. E79-A, No. 1, January, (1996), pp. 86-93.
18. T. Pedersen, “A threshold Cryptosystem without a Trusted Party”, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt’ 91, Springer, (1992), pp. 522-526.
19. B. Schoenmakers, “Efficient proofs of OR”, manuscript, (1993), 3 pages.