Abstract
We introduce oblivious decision proofs and agnostic decision proofs. In the former, the prover does not have to know whether the instance is in the language proven or not in order to be able to perform the decision proof; in the latter, the prover cannot even find out this information from interacting in the protocol. The proofs are minimum-knowledge, limiting the knowledge exposed to the verifier as well. We demonstrate an easily distributable oblivious computational minimum-knowledge decision proof protocol for proving validity/invalidity of undeniable signatures. This method, using obliviousness, solves an open problem [6] of practical value: the distributed verification of undeniable signatures. We also present an agnostic proof for the same language; an agnostic prover reduces the dissemination of trust in the system; in fact, a prover can be blindfolded and not get to learn the input. As part of the agnostic protocol, and perhaps of independent interest, we exhibit an efficient zero-knowledge proof of knowledge (possession) of both a base and an exponent of an element of a finite group (and similar algebraic structures). Finally, we show a perfect agnostic minimum-knowledge decision proof protocol for quadratic residuosity modulo Blum integers.
Research supported by NSF YI Award CCR-92-570979, Sloan Research Fellowship BR-3311, and The Royal Swedish Academy of Sciences. Work initiated while visiting Digicash. Part of the work done while visiting IBM T.J. Watson.
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
M. Abadi, J. Feigenbaum, and J. Kilian, “On Hiding Information from an Oracle,” Journal of Computer and System Sciences, v. 39, n. 1, Aug 1989, pp. 21–50.
D. Beaver, J. Feigenbaum and V. Shoup, “Hiding Instances in Zero-Knowledge Proof Systems,” Crypto’ 90, pp. 326–338
M. Bellare, S. Goldreich, “On Defining Proofs of Knowledge,” Crypto’ 92, pp. 390–420
D. Chaum and H. van Antwerpen, “Undeniable Signatures,” Crypto’ 89, pp. 212–216
D. Chaum, “Zero-Knowledge Undeniable Signatures,” Eurocrypt’ 90, pp. 458–464
D. Chaum, J. Boyar, I. Damgård, M. Jakobsson, T. Pedersen, “Undeniable Signatures: Applications and Theory,” manuscript to be submitted.
U. Feige, A. Fiat and A. Shamir, “Zero-knowledge Proofs of Identity”, Journal of Cryptology, 1988, Vol 1, pp 77–94
J. Feigenbaum and R. Ostrovsky, “A Note on One-Prover Instance-Hiding, Zero-Knowledge Proof Systems,” Asiacrypt’ 91.
A. Fujioka, T. Okamoto, K. Ohta, “Interactive Bi-Proof Systems and Undeniable Signature Schemes,” Eurocrypt’ 91, pp. 243–256
Z. Galil, S. Haber, M. Yung, “Minimum-Knowledge Interactive Proofs for Decision Problems,” SIAM Journal of Computing, 1988.
S. Goldwasser, S, Micali and C. Rackoff, “The Knowledge Complexity of Interactive Proof Systems”, SIAM Journal on Computing, vol. 18, n. 1, Feb. 1989, pp. 186–208
T. Okamoto and K. Ohta, “Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducibility,” Eurocrypt’ 89, pp. 134–149
R. Ostrovsky, R. Venkatesan, and M. Yung, “Interactive Hashing Simplifies Zero Knowledge Protocol Design”, Eurocrypt’ 90.
T. Pedersen, “Distributed Provers with Applications to Undeniable Signatures,” Eurocrypt’ 91, pp. 221–238
M. Tompa and H. Woll, “Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,” Proceedings of the 28th FOCS, 1987, pp. 472–482
A. Yao, “How to Generate and Exchange Secrets,” Proceedings of the 27th FOCS, 1986, pp. 162–167
A. Yao, “Protocols for Secure Computations,” FOCS’ 82, pp. 160–164
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
Jakobsson, M., Yung, M. (1996). Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive