Multiparty quantum coin flipping
暂无分享,去创建一个
[1] W. Wootters,et al. A single quantum cannot be cloned , 1982, Nature.
[2] Michael E. Saks. A Robust Noncryptographic Protocol for Collective Coin Flipping , 1989, SIAM J. Discret. Math..
[3] Nathan Linial,et al. Collective Coin Flipping , 1989, Adv. Comput. Res..
[4] Charles H. Bennett,et al. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.
[5] Schumacher,et al. Noncommuting mixed states cannot be broadcast. , 1995, Physical review letters.
[6] L. Goldenberg,et al. Quantum Gambling , 1998, quant-ph/9808001.
[7] Noam Nisan,et al. Quantum circuits with mixed states , 1998, STOC '98.
[8] Isaac L. Chuang,et al. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.
[9] Uriel Feige,et al. Noncryptographic selection protocols , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[10] I. Chuang,et al. Quantum Computation and Quantum Information: Bibliography , 2010 .
[11] Andrew Chi-Chih Yao,et al. Quantum bit escrow , 2000, STOC '00.
[12] Andris Ambainis,et al. Lower bound for a class of weak quantum coin flipping protocols , 2002, quant-ph/0204063.
[13] Franz Rendl,et al. Semidefinite programming and integer programming , 2002 .
[14] R W Spekkens,et al. Quantum protocol for cheat-sensitive weak coin flipping. , 2002, Physical review letters.
[15] Rainer Wilmink,et al. Huge Quantum Broadcast Channels and Cryptographic Applications for Separable States , 2005, Electron. Notes Discret. Math..
[16] Iordanis Kerenidis,et al. Weak coin flipping with small bias , 2004 .
[17] Andris Ambainis. A new protocol and lower bounds for quantum coin flipping , 2004, J. Comput. Syst. Sci..
[18] Carlos Mochon. Quantum weak coin-flipping with bias of 0.192 , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.