Random Selection with an Adversarial Majority
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- Vol. 13 (026) , 409-426
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Fast leader-election protocols with bounded cheaters' edge2006
- Constant-round coin-tossing with a man in the middle or realizing the shared random string model2003
- Randomness-efficient oblivious sampling2002
- Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions2001
- Multiparty Computation with Faulty Majority2001
- Perfect-Information Leader Election with Optimal ResilienceSIAM Journal on Computing, 2000
- Fast perfect-information leader-election protocols with linear immunityCombinatorica, 1995
- Coin-Flipping Games Immune against Linear-Sized CoalitionsSIAM Journal on Computing, 1993
- Multiparty unconditionally secure protocols1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988