26 search results - page 1 / 6 » Counting by Coin Tossings |
ASIAN
2004
Springer
13 years 10 months ago
2004
Springer
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...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
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...
JCT
2002
13 years 5 months ago
2002
Suppose we toss an independent coin with probability of success p for each subset of [n] = {1, . . . , n}, and form the random hypergraph P(n, p) by taking as hyperedges the subse...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
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...