Convertible undeniable signatures

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

Volumn 537 LNCS, Issue , 1991, Pages 189-205

  Boyar, Joan ^a   Chaum, David ^b   Damgård, Ivan ^a   Pedersen, Torben ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DIGITAL SIGNATURE SCHEMES; SINGLE-BIT; UNDENIABLE SIGNATURE; UNDENIABLE SIGNATURE SCHEME;

AUTHENTICATION;

EID: 84958769452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_14     Document Type: Conference Paper

References (16)

1. Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156-189, 1988.
2. Jørgen Brandt, Ivan Damgård, Peter Landrock, and Torben Pedersen. Zero-knowledge authentication scheme with secret key exchange. Submitted to Journal of Cryptology, 1989.
3. David Chaum, Jan-Hendrik Evertse, and Jeroen van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology-proceedings of EUROCRYPT 87, Lecture Notes in Computer Science. Sprnger-Verlag, 1988.
4. David Chaum. Zero-knowledge undeniable signatures. To appear in the proceedings of EUROCRYPT’90, 1990.
5. David Chaum and Hans van Antwerpen. Undeniable signatures. In Advances in Cryptology-proceedings of CRYPTO 89, Lecture Notes in Computer Science. Springer Verlag, 1990.
6. Taher El Gamal. A public key cryptosystem and a signatures scheme based on discrete logarithms. In Advances in Cryptology-proceedings of CRYPTO 84, Lecture Notes in Computer Science. Springer-Verlag, 1985.
7. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. In Proceedings of the 25th IEEE Symposium on the Foundations of Comparer Science, 1984.
8. Oded Goldreich and Leoma A. Levin. A hard-core predicate for all oneway functions. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.
9. S. Goldwasser, S. Micali, and R. L. Rivest, A digital signature scheme secure against adaptive chosen message attack. SIAM Journal on Computing, 17(2):281-308, April 1988.
10. Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 174-187, 1986.
11. Russel Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, 1989.
12. Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.
13. Russel Impagliazzo and Moti Yung. Direct minimum-knowledge computations. In Advances in Cryptology-proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 40-51. Springer-Verlag, 1988.
14. S. Micali, August 1990. Personal communication.
15. Moni Naor. Bit commitment using randomness. In Advances in Cryptology-proceedings of CRYPTO 89, Lecture Notes in Computer Science, pages 128-136, 1990.
16. John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.