How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge

DOI10.1007/978-3-540-78524-8_6zbMath1162.94390OpenAlexW1821685473MaRDI QIDQ5445500

Lior Malka

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_6

zbMATH Keywords

cryptographyperfect simulationperfect zero-knowledgecomplete problemsnon-interactiveerror shifting

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ Super-Perfect Zero-Knowledge Proofs ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A language-dependent cryptographic primitive
• Statistical zero-knowledge languages can be recognized in two rounds
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• The knowledge complexity of quadratic residuosity languages
• On relationships between statistical zero-knowledge proofs
• Zero knowledge with efficient provers
• 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
• Mathematical Foundations of Computer Science 2004
• A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)

This page was built for publication: How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge