搜索结果: 1-6 共查到“coin-flipping”相关记录6条 . 查询时间(0.046 秒)
A two-party coin-flipping protocol is ϵϵ-fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more than
...
Adaptively Secure Coin-Flipping, Revisited
coin-flipping full-information adaptive adversary
2016/1/3
The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of n players with t=t(n) faul...
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
cryptographic protocols / mixed commitment quantum common reference string zero knowledge secure function evaluation
2012/3/29
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 with quantum-computat...
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
mixed commitment quantum common reference string zero knowledge secure function evaluation
2011/2/23
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 with quantum-computat...
Tight Bounds for Classical and Quantum Coin Flipping
Tight Bounds for Classical Quantum Coin Flipping
2010/10/21
Coin flipping is a cryptographic primitive for which strictly better protocols exist if the
players are not only allowed to exchange classical, but also quantum messages. During the past
few years, ...
Improved Loss-Tolerant Quantum Coin Flipping
Improved Loss-Tolerant Quantum Coin Flipping
2010/10/18
In this paper, we present a loss-tolerant quantum strong coin flipping protocol with bias
" 0:359. This is an improvement over Berlin et al. ’s protocol [BBBG08] which achieves a bias of 0:4. To ac...