A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 213-224
- https://doi.org/10.1007/3-540-46766-1_16
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the success probability of the two provers in one-round proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Witness indistinguishable and witness hiding protocolsPublished by Association for Computing Machinery (ACM) ,1990
- Perfect zero-knowledge in constant roundsPublished by Association for Computing Machinery (ACM) ,1990
- Everything in NP can be argued in perfect zero-knowledge in a bounded number of roundsPublished by Springer Nature ,1989
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- On the power of multi-power interactive protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Zero knowledge proofs of identityPublished by Association for Computing Machinery (ACM) ,1987
- The complexity of perfect zero-knowledgePublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986