Publication:5750398
From MaRDI portal
zbMath0718.68033MaRDI QIDQ5750398
Joe Kilian, Oded Goldreich, Shafi Goldwasser, Silvio Micali, Michael Ben-Or, Phillip Rogaway, Johan T. Håstad
Publication date: 1990
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
Related Items
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, An Equivalence Between Zero Knowledge and Commitments, The Complexity of Zero Knowledge, Locally random reductions: Improvements and applications, A language-dependent cryptographic primitive, Statistical zero-knowledge languages can be recognized in two rounds, Relativized perfect zero knowledge is not BPP, A uniform-complexity treatment of encryption and zero-knowledge, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, The knowledge complexity of quadratic residuosity languages, Interactive and probabilistic proof-checking, On relationships between statistical zero-knowledge proofs