Abstract
The concept of proofs-of-knowledge, introduced in the seminal paper of Goldwasser, Micali and Rackoff, plays a central role in various cryptographic applications. An adequate formulation, which enables modular applications of proofs of knowledge inside other protocols, was presented by Bellare and Goldreich. However, this formulation depends in an essential way on the notion of expected (rather than worst-case) running-time. Here we present a seemingly more restricted notion that maintains the main feature of the prior definition while referring only to machines that run in strict probabilistic polynomial-time (rather than to expected polynomial-time).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barak, B., Lindell, Y.: Strict Polynomial-Time in Simulation and Extraction. SIAM J. on Comput. 33(4), 783–818 (2004)
Barak, B., Lindell, Y., Vadhan, S.: Lower Bounds for Non-Black-Box Zero-Knowledge. J. of Comp. and Sys. Sci. 72(2), 321–391 (2006)
Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390–420. Springer, Heidelberg (1993)
Feige, U., Fiat, A., Shamir, A.: Zero-Knowledge Proofs of Identity. J. of Crpto. 1, 77–94 (1988)
Feige, U., Shamir, A.: Zero Knowledge Proofs of Knowledge in Two Rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526–544. Springer, Heidelberg (1990)
Goldreich, O.: Secure Multi-Party Computation. Unpublished manuscript (1998), Superseded by (8, Chap. 7), http://www.wisdom.weizmann.ac.il/?oded/foc.html
Goldreich, O.: Foundation of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)
Goldreich, O.: Foundation of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)
Goldreich, O.: On Expected Probabilistic Polynomial-Time Adversaries – A suggestion for restricted definitions and their benefits. J. of Crypto. 23(1), 1–36 (2010)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. J. of the ACM 38(1), 691–729 (1991); Preliminary Version in 27th FOCS (1986)
Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. on Comput. 18, 186–208 (1989); Preliminary Version in 27th FOCS (1986)
Lindell, Y.: Constant-Round Zero-Knowledge Proofs of Knowledge. ECCC, TR11-003 (January 2011)
Tompa, M., Woll, H.: Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information. University of California (San Diego), Computer Science and Engineering Department, Technical Report Number CS92-244 (June 1992); Preliminary version in 28th FOCS, pp. 472–482 (1987)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goldreich, O. (2011). Strong Proofs of Knowledge. In: Goldreich, O. (eds) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science, vol 6650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-22670-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22669-4
Online ISBN: 978-3-642-22670-0
eBook Packages: Computer ScienceComputer Science (R0)