Quantum commitments from complexity assumptions
- 29 October 2015
- journal article
- Published by Springer Nature in computational complexity
- Vol. 25 (1) , 103-151
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- QIP = PSPACECommunications of the ACM, 2010
- PSPACE has constant-round quantum interactive proof systemsTheoretical Computer Science, 2003
- Quantum FingerprintingPhysical Review Letters, 2001
- Cryptographic distinguishability measures for quantum-mechanical statesIEEE Transactions on Information Theory, 1999
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- Fidelity for Mixed Quantum StatesJournal of Modern Optics, 1994
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Completely Bounded Maps between C∗ -AlgebrasJournal of the London Mathematical Society, 1983