Weaknesses of undeniable signature schemes

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

Volumn 547 LNCS, Issue , 1991, Pages 205-220

  Desmedt, Yvo ^a   Yung, Moti ^b  

^a of EE & CS ^*  (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY;

MULTIPLICATIVE NATURE; RSA SIGNATURE SCHEMES; SECURITY PROBLEMS; UNDENIABLE SIGNATURE; UNDENIABLE SIGNATURE SCHEME; ZERO KNOWLEDGE PROOF;

NETWORK SECURITY;

EID: 84958770476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46416-6_19     Document Type: Conference Paper

References (23)

1. M. Blum. Coin flipping by telephone — a protocol for solving impossible problems. In digest of papers COMPCON82, pp. 133-137. IEEE Computer Society, February 1982.
2. J. Boyar, D. Chaum, I. Damgard, and T. Pedersen. Convertible undeniable signatures. Presented at Crypto ’90, August 12-15, 1990, Santa Barbara, California, U.S.A., to appear in: Advances in Cryptology. Proc. of Crypto '90 (Lecture Notes in Computer Science), Springer-Verlag, 1990.
3. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24 (2), pp. 84-88, February 1981.
4. D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, 1 (1), pp. 65-75, 1988.
5. D. Chaum. On weaknesses of ‘weaknesses of undeniable signatures'. Presented at the rump session of Eurocrypt ’91, Brighton, U.K., April (Communicated to us by Gus Simmons.) 1991.
6. D. Chaum. Personal Communication (over the phone, no coin flipping!).
7. D. Chaum. Zero-knowledge undeniable signatures. In I. Damgård, editor, Advances in Cryptology, Proc. of Eurocrypt’90 (Lecture Notes in Computer Science 473), pp. 458-464. Springer-Verlag, 1991. Aarhus, Denmark, May 21-24.
8. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 11-19, May 2-4, 1988.
9. D. Chaum, I. Damgard, and J. van de Graaf. Multiparty computations ensuring privacy of each party’s input and correctness of the result. In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’87 (Lecture Notes in Computer Science 293), pp. 87-119. Springer-Verlag, 1988. Santa Barbara, Ca., August 16-20, 1987.
10. D. Chaum and H. van Antwerpen. Undeniable signatures. In G. Brassard, editor, Advances in Cryptology—Crypto’89, Proceedings (Lecture Notes in Computer Science 435), pp. 212-216. Springer-Verlag, 1990. Santa Barbara, California, U.S.A., August 20-24.
11. G. I. Davida. Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem. Tech. Report TR-CS-82-2, University of Wisconsin-Milwaukee, October 1982.
12. W. de Jonge and D. Chaum. Attacks on some RSA signatures. In Advances in Cryptology: Crypto’85, Proceedings (Lecture Notes in Computer Science 218), pp. 18-27. Springer-Verlag, New York, 1986. Santa Barbara, California, U.S.A., August 18-22, 1985.
13. W. de Jonge and D. Chaum. Some variations on RSA signatures & their security. In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto’86 (Lecture Notes in Computer Science 263), pp. 49-59. Springer-Verlag, 1987. Santa Barbara, California, U. S. A., August 11-15.
14. R. A. DeMilo, and M. J. Merritt Chosen signature cryptanalysis of public key cryptosystems. Technical Memorandum, Georgia Institute of Technology, October 1982.
15. D. E. R. Denning. Digital signatures with RSA and other public-key cryptosystems. Comm. ACM 27, pp. 388-392, 1984.
16. Y. Desmedt, C. Goutier, and S. Bengio. Special uses and abuses of the Fiat-Shamir passport protocol. In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’87 (Lecture Notes in Computer Science 293), pp. 21-39. Springer-Verlag, 1988. Santa Barbara, California, U.S.A., August 16-20.
17. Y. Desmedt and A. Odlyzko. A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. In Hugh C. Williams, editor, Advances in Cryptology: Crypto’85, Proceedings (Lecture Notes in Computer Science 218), pp. 516-522. Springer-Verlag, 1986. Santa Barbara, California, U.S.A., August 18-20.
18. O. Dolev and A. Yao. On the security of public key cryptography. IEEE Trans. Inform. Theory, 29, pp. 198-208, March 1983.
19. Z. Galil, S. Haber, and M. Yung. Cryptographic computations: secure fault-tolerant protocols and the public-key model In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’87 (Lecture Notes in Computer Science 293), pp. 135-155. Springer-Verlag, 1988. Santa Barbara, Ca., August 16-20, 1987.
20. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the Nineteenth annual ACM Symp. Theory of Computinq, STOC, pp. 218-229, May 25-27, 1987.
21. S. Micali. Public announcement at Crypto '89.
22. J. H. Moore. Protocol failures in cryptosystems. Proc. IEEE, 76(5), pp. 594-602, May 1988.
23. T. Okamoto and K. Ohta. Divertible zero knowledge interactive proofs and commutative random self-reducibility. In J.-J. Quisquater and J. Vande-walle, editors, Advances in Cryptology, Proc. of Eurocrypt’89 (Lecture Notes in Computer Science 434), PP. 134-149. Springer-Verlag, 1990. Houthalen, Belgium, April 10-13.