Abstract
Suppose that two ZKIPs are given for language L1 and L2. The total number of bits communicated is the sum of the two. This paper shows that it is possible to get the same effect in less amount of communication. We call such protocols “multi-language zero knowledge interactive proof systems”.
Chapter PDF
Similar content being viewed by others
References
Blum: “Coin flipping by telephone”, IEEE, COMPCON, pp.133–137 (1982)
Blum: “How to prove a theorem so no one else can claim it Proc. International Congress of Mathematics, pp.1444–1451 (1986)
Brassard, Chaum and Crepeau: “Minimum disclosure proofs of knowledge”, JCSS, pp.156–166 (1988)
Goldwasser, Micali and Rackoff: “The knowledge complexity of interactive proof systems”, SIAM J. on Comp. vol.18, No.1, pp.186–208 (1989)
Goldreich, Micali and Wigderson: “How to prove all NP-statements in zero knowledge, and a methodology of cryptographic protocol design”, Crypt’86, pp.171–185 (1986)
Kurosawa, Itoh and Takeuchi: “Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number”, Electronics Letters, vol.23, No.15, pp.809–810 (1987), CRYPTOLOGIA, vol.XII, No.4, pp.225–233 (1988)
Rabin: “Probabilistic algorithms in finite fields”, SIAM J. Comput. 9, pp.273–280 (1980)
Tompa and Woll: “Random self reducibility and zero knowledge interactive proofs of possession of information”, FOCS, pp.472–482 (1987)
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
Kurosawa, K., Tsujii, S. (1991). Multi-Language Zero Knowledge Interactive Proof Systems. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive