Sciweavers

12 search results - page 1 / 3
» An Optimally Fair Coin Toss
Sort
View
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 5 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
FOCS
2010
IEEE
13 years 2 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
CRYPTO
2010
Springer
145views Cryptology» more  CRYPTO 2010»
13 years 4 months ago
Protocols for Multiparty Coin Toss with Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC...
Amos Beimel, Eran Omri, Ilan Orlov
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 10 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
FOCS
2010
IEEE
13 years 2 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin