Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
- 1 October 1986
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 174-187
- https://doi.org/10.1109/sfcs.1986.47
Abstract
In this paper we demonstrate the generality and wide applicability of zero-knowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff. These are probabilistic and interactive proofs that, for the members x of a language L, efficiently demonstrate membership in the language without conveying any additional knowledge. So far, zero-knowledge proofs were known only for some number theoretic languages in NP ∩ Co-NP.Keywords
This publication has 14 references indexed in Scilit:
- Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A robust and verifiable cryptographically secure election schemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- How to share a secretCommunications of the ACM, 1979
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971