Author:
Kalai Yael Tauman,Komargodski Ilan,Raz Ran
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference33 articles.
1. B. Awerbuch, M. Blum, B. Chor, S. Goldwasser and S Micali: How to implement bracha’s o(logn) byzantine agreement algorithm, 1985, unpublished manuscript.
2. M. Ajtai and N. Llnial: The influence of large coalitions, Combinatorial 13 (1993), 129–145.
3. N. Alon and M. Naor: Coin-flipping games immune against linear-sized coalitions, SIAM J. Comput. 22 (1993), 403–417.
4. B. Alon and E. Omri: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, in: Theory of Cryptography - 14th International Conference, TCC 2016-B, 307–335, 2016.
5. J. Aspnes: Lower bounds for distributed coin-flipping and randomized consensus, J. Acm 45 (1998), 415–450.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SoK: Distributed Randomness Beacons;2023 IEEE Symposium on Security and Privacy (SP);2023-05