A new protocol and lower bounds for quantum coin flipping

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 134-142

  Ambainis, A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

QUANTUM COIN FLIPPINGS;

QUANTUM CRYPTOGRAPHY;

EID: 0034826544     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380788     Document Type: Conference Paper

References (29)

1. Quantum circuits with mixed states
2. Quantum bit escrow
3. Quantum cryptography: Public-key distribution and coin tossing
4. A proof of the security of quantum key distribution
5. Coin flipping by telephone: A protocol for solving impossible problems
6. Quantum complexity theory
7. How to convert the flavour of a quantum bit commitment
8. Perfectly concealing quantum bit commitment from any quantum one-way permutation
9. Cryptographic distinguishability measures for quantum mechanical states
10. Quantum gambling
11. From quantum cheating to quantum security
12. Fidelity for mixed quantum states
13. Insecurity of quantum secure computations
14. Is quantum bit commitment really possible?
15. Why quantum bit commitment and ideal quantum coin tossing are impossible
16. Unconditional security of quantum key distribution over arbitrarily long distances
17. Unconditionally secure quantum bit commitment is impossible
18. Unconditional security in quantum cryptography
19. Interaction in quantum communication complexity and the complexity of set disjointness
20. Conditions for a class of entanglement transformations
21. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
22. Simple proof of security of the BB84 quantum key distribution protocol
23. The 'transition probability' in the state space of *-algebra