Abstract
Suppose that the NSA had announced the possession of an efficient factorization algorithm. The cryptology community, after recovering from the initial shock, would demand to see the algorithm and verify it. This request, however, could not be satisfied since the algorithm would probably be classified as top-secret information.
In this note we give a procedure which will satisfy both sides of the above imaginary dispute. This is a way in which one party can prove possession of some “computational power” (e.g., a special-purpose efficient factorization machine) without revealing any algorithmic detail about this computational task (e.g., the factoring algorithm).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Bach, Generating Random Numbers with Known Factors, SIAM Journal on Computing.
M. Blum, How to Prove a Theorem so No One can Claim It, International Conf. of. Math., 1987.
G. Brassard, D. Chaum and Crépeau C., Minimum Disclosure Proofs of Knowledge, J. Comp. Sys. Sci. 37-2, pp. 156–189.
G. Brassard, Crpeau C. and M. Yung, Any NP statement can be proved in perfect zero-knowledge in bounded number of rounds, ICALP 1989.
U. Feige, A. Fiat and A. Shamir, Zero-Knowledge Proof of Identity, Proc. 19th STOC, 1987, pp. 210–217.
Z. Galil, S. Haber and M. Yung, A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems, FOCS, 1985 pp. 360–371.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Proc. 17th STOC, 1985, pp. 291–304.
S. Goldreich, S. Micali and A. Wigderson, Proofs that Yields Nothing But their Validity, and a Methodology of Cryptographic Protocol Design, Proc. 27th FOCS, 1986.
U. Gurevich and S. Shelah, Private Communication.
L. Hemachandra, M. Abadi, E. Allender, A. Broder, and J. Feigenbaum On Generating Solved Instances of Computational Problems, Proc. of Crypto 88.
R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computations, Crypto 87.
M. O. Rabin, Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
M. Tompa and H. Woll, Random Self-reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, FOCS, 1987, pp 472–482.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yung, M. (1990). Zero-Knowledge Proofs of Computational Power. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive