Sciweavers

6 search results - page 1 / 2
» n-State Quantum Coin Flipping Protocol
Sort
View
ITCC
2005
IEEE
13 years 10 months ago
n-State Quantum Coin Flipping Protocol
Atsushi Waseda, Masakazu Soshi, Atsuko Miyaji
FOCS
2009
IEEE
13 years 8 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
13 years 10 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
13 years 11 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
CORR
2011
Springer
167views Education» more  CORR 2011»
12 years 11 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen