Sciweavers

19 search results - page 1 / 4
» Using biased coins as oracles
Sort
View
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 5 months ago
Using biased coins as oracles
Toby Ord, Tien D. Kieu
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 2 months ago
Private Coins versus Public Coins in Zero-Knowledge Proof Systems
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
CRYPTO
2010
Springer
145views Cryptology» more  CRYPTO 2010»
13 years 5 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
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 8 days ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 9 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes