Erratum: RSA-based undeniable signatures (Journal of Cryptology DOI: 10.1007/s001450010001);RSA-Based undeniable signatures

Journal of Cryptology

Volumn 13, Issue 4, 2000, Pages 397-416

  Gennaro, Rosario ^a   Rabin, Tal ^a   Krawczyk, Hugo ^a  

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

Author keywords

RSA; Undeniable signatures; Zero knowledge

Indexed keywords

EID: 0012081094     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-007-0202-1     Document Type: Erratum

References (28)

1. [BCC] G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2): 156-189, 1988.
2. [BCDP] J. Boyar, D. Chaum, I. Damgard, and T. Pedersen. Convertible undeniable signatures. In A. J. Menezes and S. Vanstone, editors, Advances in Cryptology -Crypto '90, pages 189-205. Springer-Verlag, Berlin, 1990. Lecture Notes in Computer Science No. 537.
3. [BRI] M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages" 62-73,1993.
4. [BR2] M. Bellare and P. Rogaway. The exact security of digital signatures, how to sign with RSA and Rabin. In U. Maurer, editor, Advances in Cryptology -Eurocrypt '96, pages 399-416. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1070.
5. [CA] D. Chaum and H. van Antwerpen. Undeniable signatures. In G. Brassard, editor, Advances in Cryptology - Crypto '89, pages 212-217. Springer-Verlag, Berlin, 1989. Lecture Notes in Computer Science No. 435.
6. [CEG] D. Chaum, J.-H. Evertse, and J. van der Graaf. An improved protocol for demonstrating possession of a discrete logarithm and some generalizations. In D. Chaum, editor, Advances in Cryptology -Eurocrypt '87, pages 127-141. Springer-Verlag, Berlin, 1987. Lecture Notes in Computer Science No. 304.
7. [Ch1] D. Chaum. Zero-knowledge undeniable signatures. In I. Damgard, editor, Advances in CryptologyEurocrypt '90, pages 458-464. Springer-Verlag, Berlin, 1990. Lecture Notes in Computer Science No. 473.
8. [Ch2] D. Chaum. Designated confirmer signatures. In A. De Santis, editor, Advances in Cryptology -Eurocrypt '94, pages 86-91. Springer-Verlag, Berlin, 1994. Lecture Notes in Computer Science No. 950.
9. [CHP] D. Chaum, E. van Heijst, and B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. In J. Feigenbaum, editor, Advances in Cryptology -Crypto '91, pages 470-484. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 576.
10. [CP] D. Chaum and T. Pedersen. Wallet databases with observers. In E. Brickell, editor, Advances in Cryptology - Crypto '92, pages 89-105. Springer-Verlag, Berlin, 1992. Lecture Notes in Computer Science No. 740.
11. [DDFY] A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proceedings of the 26th Annual Symposium on the Theory of Computing, pages 522-533. ACM, New York, 1994.
12. [DP] I. Damgård and T. Pedersen. New convertible undeniable signature schemes. In U. Maurer, editor, Advances in Cryptology - Eurocrypt '96, pages 372-386. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1070.
13. [DY] Y Desmedt and M. Yung. Weaknesses of undeniable signature schemes. In J. Feigenbaum, editor, Advances in Cryptology - Crypto '91, pages 205-220. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 576.
14. [FOO] A. Fujioka, T. Okamoto, and K. Ohta. Interactive bi-proof systems and undeniable signature schemes. In D. Davies, editor, Advances in Cryptology - Eurocrypt '91, pages 243-256. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 547.
15. [FS] A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In A. Odlyzko, editor. Advances in Cryptology -Crypto '86, pages 186-194. Springer-Verlag, Berlin, 1986. Lecture Notes in Computer Science No. 263.
16. [GJKR] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In N. Koblitz, editor, Advances in Cryptology -Crypto '96, pages 157-172. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1109.
17. [GK] O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM Journal on Computing, 25(1):169-192,1996.
18. [GMR] R. Gennaro, D. Micciancio, and T. Rabin. An efficient noninteractive statistical zero-knowledge proof system for quasi-safe prime products. In Proceedings of the 5th ACM Conference on Computer and Communications Security, pages 67-72, 1998.
19. [GMW] O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38():691-729,1991.
20. [Go] O. Goldreich. Foundation of Cryptography -Fragments of a Book. Electronic Colloquium on Computational Complexity, February 1995. Available online from http://www.eccc.uni-trier.de/eccc/.
21. [Ja] M. Jakobsson. Blackmailing using undeniable signatures. In A. De Santis, editor, Advances in Cryptology -Eurocrypt '94, pages 425-427. Springer-Verlag, Berlin, 1994. Lecture Notes in Computer Science No. 950.
22. [JSI] M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In U. Maurer, editor. Advances in Cryptology-Eurocrypt '96, pages 143-154. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1070.
23. [J Y] M. Jakobsson and M. Yung. Proving without knowing: on oblivious, agnostic and blindfolded provers. In N. Koblitz, editor, A avances in Cryptology-Crypto '96, pages 201-215. Springer-Verlag, Berlin, 1996. Lecture Notes in Computer Science No. 1109.
24. [Me] K. McCurley. A key distribution system equivalent to factoring. Journal of Cryptology, 1:95-105, 1988.
25. [MPP] M. Michels, H. Petersen, and P. Horster. Breaking and repairing a convertible undeniable signature scheme. In Proceedings of the 3rd ACM Conference on Computer and Communications Security, pages 148-152,1996.
26. [Ok] T. Okamoto. Designated confirmer signatures and public-key encryption are equivalent. In Y. Desmedt, editor, Advances in Cryptology -Crypto '94, pages 61-74. Springer-Verlag, Berlin, 1994. Lecture Notes in Computer Science No. 839.
27. [Pe] T. Pedersen. Distributed provers with applications to undeniable signatures. In D. Davies, editor, Advances in Cryptology -Eurocrypt '91, pages 221-242. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science No. 547.
28. [Sh] Z. Shmuely. Composite Diffie-Hellman public key generating systems are hard to break. Technical Report 356, Computer Science Department, Technion, Haifa, 1985.