Threshold undeniable RSA signature scheme

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

Volumn 2229, Issue , 2001, Pages 221-232

  Wang, Guilin ^a   Qing, Sihan ^a   Wang, Mingsheng ^a   Zhou, Zhanfei ^b  

^a INSTITUTE OF SOFTWARE   (China)

^b NIHON UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

DISCRETE LOGARITHMS; RSA SIGNATURE SCHEMES; THRESHOLD RSA SIGNATURES; UNDENIABLE SIGNATURE;

AUTHENTICATION;

EID: 84956979177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45600-7_25     Document Type: Conference Paper

References (21)

1. J. Boyar, D. Chaum, I. Damgård, and T. Pedersen. Convertible Undeniable Signatures. In Crypto’90, LNCS 537, pp. 189-205. Springer-Verlag, 1991.
2. D. Chaum. Zero-Knowledge Undeniable Signatures. In: Eurocrypt’90, LNCS 473, pp. 458-464. Springer-Verlag, 1991.
3. J. Camenisch, and M. Michels. Proving in Zero-knowledge that a Number Is the Product of Two Safe Primes. In Eurocrypt’99, LNCS 1592, pp.107-122. Springer-Verlag, 1999.
4. D. Chaum, and T.P. Pedersen. Transferred Cash Grows in Size. In Eurocrypt’92, LNCS 658, pp. 390-407. Springer-Verlag, 1993.
5. D. Chaum, and T.P. Pedersen. Wallet Databases With Observers. In Crypto’92, LNCS 740, pp. 89-105, Springer-Verlag, 1993.
6. D. Chaum, and H. Van Antwerpen. Undeniable Signatures. In Crypto’89, LNCS 435, pp. 212-216, Springer-Verlag, 1989.
7. Y. Desmedt. Society and Group Oriented Cryptography: A New Concept. In Crypto’87, LNCS 293, pp. 120-127, Springer-Verlag, 1988.
8. Y. Desmedt, and Y. Frankel. Threshold Cryptosystems. In Crypto’89, LNCS 435, pp. 307-315, Springer-Verlag, 1990.
9. I. Damgård, and M. Koprowski. Practical Threshold RSA Signature Without a Trusted Dealer. In Eurocrypt 2001 (to appear). Available from http://www.daimi.au.dk/ivan/papers.html.
10. I. Damgård, and T. Pedersen. New Convertible Undeniable Signature Schemes. In Eurocrypt’96, LNCS 1070, pp. 372-386, Springer-Verlag, 1996.
11. Y. Frankel, P. D. MacKenzie, and M. Yung. Robust Efficient Distributed RSA-Key Generation. In 30th STOC, pp. 663-672. ACM, 1998.
12. R. Gennaro, H. Krawczyk, and T. Rabin. RSA-Based Undeniable Signature. In Crypto’97, pp. 132-148, Springer-Verlag, 1997.
13. L. Harn, and S. Yang. Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party. In Auscrypt’92, LNCS 718, pp. 133-142, Springer-Verlag, 1993.
14. S.K. Langford. Weakness in Some Threshold Cryptosystems. In Crypto’ 96, LNCS 1109, pp. 74-82, Springer-Verlag, 1996.
15. N.-Y. Lee, and T. Hwang. Group-Oriented Undeniable Signature Schemes with a Trusted Center. Computer Communications, 1999, 22: 730-734.
16. C.-H. Lin, C.-T. Wang, and C.-C. Chang. A Group-Oriented (t, n) Undeniable Signature Scheme without Trusted Center. In: Information Security and Privacy, ACISP’96, LNCS 1172, pp. 266-274, Springer-Verlag, 1996.
17. T.P. Pedersen. No-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Crypto’91, LNCS 576, pp. 129-140, Springer-Verlag, 1992.
18. B. Schoenmakers. A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In Crypto’99, LNCS 1666, pp. 148-164, Springer-Verlag, 1999.
19. A. Shamir. How to Share a Secret. Communications of the ACM, 1979, 22(11): 612-613.
20. V. Shoup. Practical Threshold Signatures. In Eurocrypt’2000, LNCS 1807, pp. 207-220. Springer-Verlag, 2000. Avalaible from http://www.shoup.net/papers/.
21. M. Stadler. Publicly Verifiable Secret Sharing. In Eurocrypt’96, LNCS 1070, pp. 191-199, Springer-Verlag, 1996.