Quantum Commitments from Complexity Assumptions
From MaRDI portal
Publication:3012793
DOI10.1007/978-3-642-22006-7_7zbMath1332.68053MaRDI QIDQ3012793
Bill Rosgen, Iordanis Kerenidis, André Chailloux
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_7
94A60: Cryptography
68Q12: Quantum algorithms and complexity in the theory of computing
81P94: Quantum cryptography (quantum-theoretic aspects)
Related Items
General properties of quantum bit commitments (extended abstract), Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Quantum Arthur-Merlin games
- PSPACE has constant-round quantum interactive proof systems
- Zero-knowledge against quantum attacks
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- 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
- Fidelity for Mixed Quantum States
- Cryptographic distinguishability measures for quantum-mechanical states
- An Unconditional Study of Computational Zero Knowledge