Abstract
We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. The proofs are non-interactive pro- vided that the quadratic residuosity bit commitment scheme is available to the Prover and Verifier. For typical applications, the proofs are short enough to fit on a floppy disk.
Supported in part by NSF Grant CCR-9207204. This author is currently on sabbatical leave from the University of Wisconsin at Milwaukee.
Chapter PDF
References
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.
Blum, De Santis, Micali, Persiano: Non-interactive zero-knowledge. SIAM Journal on Computing 20 (1991) 1084–1118.
Boyar, J., Brassard, G., Peralta, R.: Subquadratic zero-knowledge. In Proceedings of the 32th IEEE Symposium on Foundations of Computer Science (1991) pp. 69–78 (to appear in JACM).
Boyar, J., Krentel, M., Kurtz, S.: A discrete logarithm implementation of zero-knowledge blobs. Journal of Cryptology 2 (1990) 63–76.
Boyar, J., Lund, C., Peralta, R.: On the communication complexity of zero-knowledge proofs. Journal of Cryptology 6 (1993) 65–85.
Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37 (1988) 156–189.
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.
Damgård, I.: Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing. In Advances in Cryptology-Proceedings of EURO-CRYPT 92 (1993) vol. 658 of Lecture Notes in Computer Science, Springer-Verlag pp. 341–355.
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.
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.
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.
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.
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.
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.
Schnorr, C.: Efficient signature generation for smart cards. Journal of Cryptology 4 (1991) 161–174.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyar, J., Peralta, R. (1996). Short Discreet Proofs. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive