How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge

DOI10.1007/s00145-013-9165-6zbMath1356.94076OpenAlexW2062945332MaRDI QIDQ2516524

Lior Malka

Publication date: 3 August 2015

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9165-6

zbMATH Keywords

cryptographyperfect simulationperfect zero-knowledgecomplete problemsnon-interactiveerror shifting

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

On the Power of Statistical Zero Knowledge ⋮ Oracle separations between quantum and non-interactive zero-knowledge classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical zero-knowledge languages can be recognized in two rounds
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Perfect zero-knowledge arguments for NP using any one-way permutation
• The knowledge complexity of quadratic residuosity languages
• On relationships between statistical zero-knowledge proofs
• Zero knowledge with efficient provers
• Zero-knowledge against quantum attacks
• Local zero knowledge
• A complete problem for statistical zero knowledge
• Perfect Non-interactive Zero Knowledge for NP
• The complexity of promise problems with applications to public-key cryptography
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Randomness-efficient non-interactive zero knowledge
• Inaccessible entropy
• Mathematical Foundations of Computer Science 2004
• An Equivalence Between Zero Knowledge and Commitments

This page was built for publication: How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge