Complete Problem for Perfect Zero-Knowledge Quantum Proof
From MaRDI portal
Publication:2891386
DOI10.1007/978-3-642-27660-6_34zbMath1302.81086OpenAlexW9702456MaRDI QIDQ2891386
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_34
quantum cryptographycomplete problemquantum complexityperfect zero-knowledgequantum zero-knowledge proof
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum Arthur-Merlin games
- Zero-knowledge against quantum attacks
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- New Generation of Secure and Practical RSA-Based Signatures
- A complete problem for statistical zero knowledge
- The Knowledge Complexity of Interactive Proof Systems
- Foundations of Cryptography
- Algorithms and Computation
- Computational Complexity
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- General Properties of Quantum Zero-Knowledge Proofs
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Computational Complexity
This page was built for publication: Complete Problem for Perfect Zero-Knowledge Quantum Proof
