Quantum commitments from complexity assumptions

DOI10.1007/s00037-015-0116-5zbMath1336.81030arXiv1010.2793MaRDI QIDQ260394

André Chailloux, Bill Rosgen, Iordanis Kerenidis

Publication date: 21 March 2016

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2793

Mathematics Subject Classification ID

68Q12: Quantum algorithms and complexity in the theory of computing

81P94: Quantum cryptography (quantum-theoretic aspects)

Cites Work

• Bit commitment using pseudorandomness
• Derandomizing Arthur-Merlin games using hitting sets
• Quantum Arthur-Merlin games
• PSPACE has constant-round quantum interactive proof systems
• QIP = PSPACE
• Zero-knowledge against quantum attacks
• Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• Completely Bounded Maps between C^∗ -Algebras
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Quantum computations: algorithms and error correction
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing
• Fidelity for Mixed Quantum States
• Cryptographic distinguishability measures for quantum-mechanical states
• An Unconditional Study of Computational Zero Knowledge
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item