Abstract
In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented. Informally speaking, we call (A,B,C), a triplet of Turing machines, a divertible zero knowledge interactive proof, if (A,B) and (B,C) are zero knowledge interactive proofs and B converts (A,B) into (B,C) such that any evidence regarding the relationship between (A,B) and (B,C) is concealed. It is shown that any commutative random self-reducible problem, which is a variant of the random self-reducible problem introduced by Angluin et al., has a divertible perfect zero knowledge interactive proof. We also show that a specific class of the commutative random self-reducible problems have more practical divertible perfect zero knowledge interactive proofs. This class of zero knowledge interactive proofs has two sides; one positive, the other negative. On the positive side, divertible zero knowledge interactive proofs can be used to protect privacy in networked and computerized environments. Electronic checking and secret electronic balloting are described in this paper to illustrate this side. On the negative side, identification systems based on these zero knowledge interactive proofs are vulnerable to an abuse, which is, however, for the most part common to all logical identification schemes. This abuse and some measures to overcome it are also presented.
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,” STOC pp.195–203 (1987)
D. Angluin and D. Lichtenstein, “Provable Security of Cryptosystems: a Survey,” Technical Report TR-288, Yale University (1983)
M. Blum, “Coin Flipping by Telephone: A Protocol for Solving Impossible Problems,” Compcon, pp133–137 (1982)
M. Blum, P. Feldman and S. Micali, “Non-Interactive Zero-Knowledge and Its Applications,” STOC, pp.103–112 (1988)
M. Ben-Or and N. Linial, “Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values,” FOCS, pp.408–416 (1985)
D. Chaum, “Security without Identification: Transaction Systems to Make Big Brother Obsolete,” Comm. of the ACM, 28,10, pp.1030–1044 (1985)
D. Chaum, “Blinding for Unanticipated Signatures,” Eurocrypto’87 (1987)
D. Chaum, “An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations,” Eurocrypto’87 (1987)
I.B. Damgård, “Payment Systems and Credential Mechanisms with Provable Security against Abuse by Individuals,” Crypto’88 (1988)
Y. Desmedt, “Subliminal-Free Authentication and Signature,” Eurocrypto’88 (1988)
Y. Desmedt, C. Goutier and S. Bengio, “Special Uses and Abuses of the Fiat-Shamir Passport Protocol,” Crypto’87 (1987)
A. DeSantis, S. Micali and G. Persiano, “Non-Interactive Zero-Knowledge Proof Systems,” Crypto’87 (1987)
U. Feige, A. Fiat and A. Shamir, “Zero Knowledge Proofs of Identity,” STOC, pp.210–217 (1987)
A. Fiat and A. Shamir, “How to Prove Yourself,” Crypto’86 (1986)
O. Goldreich, H. Krawczyk, and M. Luby, “On the Exixtence of Pseudorandom Generators,” Crypto’88 (1988)
S. Goldwasser, S. Micali, and C. Rackoff, “Knowledge Complexity of Interactive Proofs,” STOC, pp291–304 (1985)
O. Goldreich, S. Micali, and A. Wigderson, “Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design,” FOCS, pp.174–187 (1986)
S. Goldwasser, S. Micali, and R. Rivest, “A Paradoxical Solution to the Signature Problem,” FOCS, pp.441–448 (1984)
L.C. Guillou, and J.J. Quisquater, “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory,” Eurocrypto’88 (1988)
L.C. Guillou, and J.J. Quisquater, “A “Paradoxical” Identity-Based Signature Scheme Resulting from Zero-Knowledge,” Crypto’88 (1988)
S. Micali, and A. Shamir, “An Improvement of The Fiat-Shamir Identification and Signature Scheme,” Crypto’88 (1988)
K. Ohta, “Efficient Identification and Signature Schemes,” Electronics Letters, 24,2, pp.115–116 (1988)
K. Ohta, “An Electrical Voting Scheme Using a Single Administrator” (in Japanese), Spring Conference of IEICE Japan, A-294 (1988)
T. Okamoto “Proofs that Release No Use Knowledge and Their Applications,” to appear
K. Ohta, and T. Okamoto “A Modification of the Fiat-Shamir Scheme,” Crypto’88 (1988)
A. Shamir, Private Communication (1988)
M. Tompa and H. Woll, “Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,” FOCS, pp472–482 (1987)
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
Okamoto, T., Ohta, K. (1990). Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility. 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_16
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_16
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