Abstract
We investigate extending the notion of a proof of knowledge to a proof of the ability to perform some computational task. We provide some definitions and protocols for this purpose.
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
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)
Brassard, G., Crépeau, C., Laplante, S., Léger, C.: Computationally Convincing Proofs of Knowledge. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, Springer, Heidelberg (1991)
Feige, U., Fiat, A., Shamir, A.: Zero-Knowledge Proofs of Identity. Journal of Cryptology 1, 77–94 (1988)
Feige, U., Shamir, A.: Witness Indistinguishability and Witness Hiding Protocols. In: Proceedings of the Twenty Second Annual Symposium on the Theory of Computing, pp. 416–426. ACM, New York (1990)
Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. on Computing 18(1), 186–208 (1989) (Preliminary Version in the 7th STOC, 1985)
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 Dept. Technical Report Number CS92-244 (June 1992) (Preliminary Version in the 27th FOCS, pp. 472–482, 1987)
Yung, M.: Zero-knowledge proofs of computational power. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 196–207. Springer, Heidelberg (1990)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bellare, M., Goldreich, O. (2011). Proving Computational Ability. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-22670-0_2
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)