A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
From MaRDI portal
Publication:1261018
DOI10.1007/BF02620137zbMath0783.68039MaRDI QIDQ1261018
Oded Goldreich, Eyal Kushilevitz
Publication date: 29 August 1993
Published in: Journal of Cryptology (Search for Journal in Brave)
68P25: Data encryption (aspects in computer science)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical zero-knowledge languages can be recognized in two rounds
- Probabilistic encryption
- Does co-NP have short interactive proofs ?
- Minimum disclosure proofs of knowledge
- Approximate formulas for some functions of prime numbers
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- The complexity of promise problems with applications to public-key cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems