Complete Problem for Perfect Zero-Knowledge Quantum Proof

DOI10.1007/978-3-642-27660-6_34MaRDI QIDQ2891386zbMATH OpenOpenAlexFDO

Authors Jun Yan

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

zbMATH Keywords

quantum complexityquantum cryptographyperfect zero-knowledgecomplete problemquantum zero-knowledge proof

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• A complete problem for statistical zero knowledge
• Super-Perfect Zero-Knowledge Proofs
• Perfect Non-interactive Zero Knowledge for NP
• How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• General Properties of Quantum Zero-Knowledge Proofs
• Certified everlasting zero-knowledge proof for QMA
• scientific article; zbMATH DE number 4185032
• Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems

Cites work

• scientific article; zbMATH DE number 5899289 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 1418312 (Why is no real title available?)
• A complete problem for statistical zero knowledge
• Algorithms and Computation
• Computational Complexity
• Computational Complexity
• Distinguishing quantum operations having few Kraus operators
• Foundations of Cryptography
• General Properties of Quantum Zero-Knowledge Proofs
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
• New generation of secure and practical RSA-based signatures
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• Quantum Arthur-Merlin games
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(4)

• Stronger methods of making quantum interactive proofs perfectly complete
• Stronger methods of making quantum interactive proofs perfectly complete
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• General properties of quantum bit commitments (extended abstract)

This page was built for publication: Complete Problem for Perfect Zero-Knowledge Quantum Proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891386)