See this document in CiteSeerX!

An introduction to quantum coin-tossing  (Make Corrections)  
C. Doscher and M. Keyl Institut fur Mathematische Physik, TU Braunschweig,...



  Home/Search   Context   Related

 
View or download:
imaph.tubs.de/ftp/keyl...0206088.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  imaph.tubs.de/qi/papers_ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We review the quantum version of a well known problem of cryptography called coin tossing (\ipping a coin via telephone"). It can be regarded as a game where two remote players (who distrust each other) tries to generate a uniformly distributed random bit which is common to both parties. The only resource they can use to perform this task is a classical or quantum communication channel. In this paper we provide a general overview over such coin tossing protocols, concerning in particular ... (Update)

Active bibliography (related documents):   More   All
0.5:   Quantum Bit Escrow - Aharonov, Ta-Shma, Vazirani   (Correct)
0.5:   Probing the Structure of Quantum Mechanics - Aerts, Czachor, Durt (2002)   (Correct)
0.4:   Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2001)   (Correct)

Similar documents based on text:   More   All
0.4:   The Rate of Optimal Purification procedures - Keyl, Werner (1999)   (Correct)
0.4:   How to Correct Small Quantum Errors - Keyl, Werner (2002)   (Correct)
0.2:   The free Bose gas on Robertson-Walker spacetimes - Trucks, Keyl (1997)   (Correct)

BibTeX entry:   (Update)

@misc{ oscher-introduction,
  author = "Oscher And Keyl",
  title = "An Introduction to Quantum Coin-Tossing",
  url = "citeseer.ist.psu.edu/623192.html" }
Citations (may not include all citations):
182   Theory of games and economic behavior (context) - von Neumann, Morgenstern - 1944
25   Why quantum bit commitment and ideal quantum coin tossing ar.. (context) - Lo, Chau - 1998
15   Completely bounded maps and dilations (context) - Paulsen - 1986
14   Positive functions on C*-algebras (context) - Stinespring - 1955
5   A new protocol and lower bounds for quantum coin ipping (context) - Ambainis - 2002
4   Fundamentals of quantum information theory - Keyl - 2001
3   Degrees of concealment and bindingness in quantum bit commit.. (context) - Spekkens, Rudolph - 2002
2   Cheat sensitive quantum bit commitment (context) - Hardy, Kent - 1999
2   Quantum cryptography - Gisin, Ribordy et al. - 2001
1   A protocol for solving impossible problems (context) - Blum, by - 1981
1   Quantum coin tossing (context) - oscher - 2002
1   Coin tossing is strictly weaker than bit commitment (context) - Kent - 1999
1   A quantum protocol for cheat-sensitive weak coin ipping (context) - Spekkens, Rudolph - 2002
1   Unconditional secure quantum bit commitment is impossible (context) - Mayers - 1997
1   Unconditional secure quantum coin-tossing (context) - Mayers, Salvai et al. - 1999

Documents on the same site (http://www.imaph.tu-bs.de/qi/papers_.html):   More
The Rate of Optimal Purification procedures - Keyl, Werner (1999)   (Correct)
Why Two Qubits Are Special - Vollbrecht, Werner (1999)   (Correct)
Fundamentals of Quantum Information Theory - Keyl (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC