Abstract
We present a divertible zero-knowledge proof (argument) for SAT under the assumption that probabilistic encryption homomorphisms exist. Our protocol uses a simple ‘swapping’ technique which can be applied to many zero knowledge proofs (arguments). In particular we obtain a divertible zero-knowledge proof for graph isomorphism. The consequences for abuse-free zero-knowledge proofs are also considered.
Research done while visiting the EISS, University of Karlsruhe, West Germany.
Research partially supported by SERC Grant GR/F 5700.
Research is being supported by NSF Grant NCR-9004879.
Chapter PDF
Similar content being viewed by others
References
G. Brassard and C. Crépeau. Sorting out zero-knowledge. Presented at Eurocrypt’89, Houthalen, Belgium, to appear in: Advances in Cryptology. Proc. of Eurocrypt’89 (Lecture Notes in Computer Science), Springer-Verlag, April 1989.
G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2), pp. 156–189, October 1988.
M. V. D. Burmester, Y. G. Desmedt, F. Piper, and M. Walker. A general zero-knowledge scheme. Presented at Eurocrypt’ 89, Houthalen, Belgium, to appear in: Advances in Cryptology. Proc. of Eurocrypt’ 89 (Lecture Notes in Computer Science), Springer-Verlag, April 1989.
M. Blum. How to prove a theorem so no one else can claim it. In Proceedings of the International Congress of Mathematicians, pp. 1444–1451, August 3–11, 1987. Berkeley, California, U.S.A., 1986.
D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In D. Chaum and W. L. Price, editors, Advances in Cryptology — Eurocrypt’87 (Lecture Notes in Computer Science 304), pp. 127–141. Springer-Verlag, Berlin, 1988. Amsterdam, The Netherlands, April 13–15, 1987.
Y. Desmedt. Subliminal-free authentication and signature. In C. G. Günther, editor, Advances in Cryptology, Proc. of Eurocrypt’ 88 (Lecture Notes in Computer Science 330), pp. 23–33. Springer-Verlag, May 1988. Davos, Switzerland.
Y. Desmedt. Making conditionally secure cryptosystems unconditionally abuse-free in a general context. In G. Brassard, editor, Advances in Cryptology — Crypto’ 89, Proceedings (Lecture Notes in Computer Science 435), pp. 6–16. springer-Verlag, 1990. Santa Barbara, California, U.S.A., August 20–24.
Y. Desmedt, C. Goutier, and S. Bengio. Special uses and abuses of the Fiat-Shamir passport protocol. In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’ 87 (Lecture Notes in Computer Science 293), pp. 21–39. Springer-Verlag, 1988. Santa Barbara, California, U.S.A., August 16–20.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2), pp. 270–299, April 1984.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Siam J. Comput., 18(1), pp. 186–208, February 1989.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In The Computer Society of IEEE, 27th Annual Symp. on Foundations of Computer Science (FOCS), pp. 174–187. IEEE Computer Society Press, 1986. Toronto, Ontario, Canada, October 27–29, 1986.
T. Okamoto and K. Ohta. Divertible zero knowledge interactive proofs and commutative random self-reducibility. Presented at Eurocrypt’89, Houthalen, Belgium, to appear in: Advances in Cryptology. Proc. of Eurocrypt’89 (Lecture Notes in Computer Science), Springer-Verlag, April 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burmester, M.V.D., Desmedt, Y. (1991). All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive