An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast perfection-information leader-election protocol with linear immunity
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Collective coin flipping, robust voting schemes and minima of Banzhaf values
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A Chernoff bound for random walks on expander graphs
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Probabilistically Correct Leader Election Protocol for Large Groups
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Large Deviation Bounds for Markov Chains
Combinatorics, Probability and Computing
The round complexity of two-party random selection
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast leader-election protocols with bounded cheaters' edge
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Improved fault tolerance and secure computation on sparse networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Stochastic coalescence in logarithmic time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |