Multi-Language Zero Knowledge Interactive Proof Systems

Authors:
Kaoru Kurosawa;Shigeo Tsujii
Affiliations:
-;-
Venue:
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Year:
1990

Citing 5
Cited 2

How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design

Proceedings on Advances in cryptology---CRYPTO '86
Public key cryptosystem using a reciprocal number with same intractability as factoring a large number

Cryptologia
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Random self-reducibility and zero knowledge interactive proofs of possession of information

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Secure Voting Using Partially Compatible Homomorphisms

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Broadcast interactive proofs

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

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".