How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on 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
Global, unpredictable bit generation without broadcast
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
Optimal Amortized Distributed Consensus (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Maintaining Security in the Presence of Transient Faults
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Our data, ourselves: privacy via distributed noise generation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On the (im-)possibility of extending coin toss
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |