A robust noncrytographic protocol for collective coin flipping
SIAM Journal on Discrete Mathematics
Fault-tolerant computation in the full information model (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Coin-flipping games immune against linear-sized coalitions
SIAM Journal on Computing
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Lower bounds for leader election and collective coin-flipping in the perfect information model
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Perfect-Information Leader Election with Optimal Resilience
SIAM Journal on Computing
Perfect Information Leader Election in log^* n + O(1) Rounds
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
New Imperfect Random Source with Applications to Coin-Flipping
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The round complexity of two-party random selection
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Distributed implementation of a self-organizing appliance middleware
Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast leader-election protocols with bounded cheaters' edge
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bound for scalable Byzantine Agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Proceedings of the 28th ACM symposium on Principles of distributed computing
Collaborative scoring with dishonest participants
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable byzantine computation
ACM SIGACT News
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Leakage-resilient coin tossing
DISC'11 Proceedings of the 25th international conference on Distributed computing
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Rationality in the full-information model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Multiparty computation secure against continual memory leakage
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
New independent source extractors with exponential improvement
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Selection tasks generalize some well studied problems, such as collective coin flipping and leader election. We present new selection protocols in the full information model, and new negative results. In particular, when there are \math good players, we show a protocol that chooses a good leader with probability \math, and show that every leader election protocol has success probability \math, for every \math. Previously known protocols for this problem have success probability that is exponentially small in \math, and no nontrivial upper bounds on the success probability were known.