Short discreet proofs

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

Volumn 1070, Issue , 1996, Pages 131-142

  Boyar, Joan ^a   Peralta, René ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT COMMITMENT; TYPICAL APPLICATION;

CRYPTOGRAPHY;

EID: 21344436520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_12     Document Type: Conference Paper

References (16)

1. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In Proceedings of the 20th ACM Symposium on Theory of Computing (1988) pp. 103-112.
2. Blum, De Santis, Micali, Persiano: Non-interactive zero-knowledge. SIAM Journal on Computing 20 (1991) 1084-1118.
3. Boyar, J., Brassard, G., Peralta, E.: Subquadratic zero-knowledge. In Proceedings of the 32th IEEE Symposium on Foundations of Computer Science (1991) pp. 69-78 (to appear in JACM).
4. Boyar, J., Krentel, M., Kurtz, S.: A discrete logarithm implementation of zero- knowledge blobs. Journal of Cryptology 2 (1990) 63-76.
5. Boyar, J., Lund, C., Peralta, R.: On the communication complexity of zero- knowledge proofs. Journal of Cryptology 6 (1993) 65-85.
6. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37 (1988) 156-189.
7. Brassard, G., Crépeau, C.: Zero-knowledge simulation of boolean circuits. In Advances in Cryptology - Proceedings of CRYPTO 86 (1987) vol. 263 of Lecture Notes in Computer Science, Springer-Verlag pp. 223-233.
8. Damgård, I.: Non-interactive circuit based proofs and non-interactive perfect zero- knowledge with preprocessing. In Advances in Cryptology - Proceedings of EUROCRYPT 92 (1993) vol. 658 of Lecture Notes in Computer Science, Springer-Verlag pp. 341-355.
9. Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero-knowledge proofs based on a single random string. In Proceedings of the 31th IEEE Symposium on Foundations of Computer Science (1990) pp. 308-317.
10. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology - Proceedings of CRYPTO 86 (1987) vol. 263 of Lecture Notes in Computer Science, Springer-Verlag pp. 186-194.
11. Kilian, J., Petrank, E.: An efficient non-interactive zero-knowledge proof ystem for NP with general assumptions. Technical Report No. TR95-038, Electronic Colloquium in Computational Complexity (ECCC), July 1995.
12. Lenstra, A. K.: Factoring integers using the web and number field sieve. In Proceedings of JAIST International Forum on Multimedia and Information Security (1995) Japan Advanced Institute of Science and Technology pp. 93-113.
13. De Santis, A., Di Crescenzo, G., Persiano, G.: Secret sharing and perfect zero knowledge. In Advances in Cryptology - Proceedings of CRYPTO 93 (1993) vol. 773 of Lecture Notes in Computer Science, Springer-Verlag pp. 73-84.
14. Odlyzko, A.: The future of integer factorization. In Proceedings of JAIST International Forum on Multimedia and Information Security (1995) Japan Advanced Institute of Science and Technology pp. 139-151.
15. Schnorr, C.: Efficient signature generation for smart cards. Journal of Cryptology 4 (1991) 161-174.
16. van de Graaf, J., Peralta, R.: A simple and secure way to show the validity of your public key. In Advances in Cryptology - Proceedings of CRYPTO 87 (1988) vol. 293 of Lecture Notes in Computer Science, Springer-Verlag pp. 128-134.