Author:
Lichtenstein D.,Linial N.,Saks M.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. N.Alon and M. O.Rabin, On the random properties of a weakly random source, in Advances in Computing Research (Silvio Micali, ed.),to appear.
2. M.Ben-Or and N.Linial, Collective Coin Flipping, robust voting schemes and minimal of Banzhaf values,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, 408–416.
3. M.Ben-Or, N.Linial and M.Saks, Collective collective coin flipping and other models of imperfect randomness, Proceedings of edi.
4. B.Chor and O.Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, 429–442.
5. B.Chor, O.Goldreich, J.Hastad, J.Friedmann, S.Rudich and R.Smolensky, The bit extraction problem ort-resilient functions,Proc. 26th IEEE Symposium on Foundations of Computer Science (1985), 396–407.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Optimal “It Ain’t Over Till It’s Over” Theorem;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. SoK: Distributed Randomness Beacons;2023 IEEE Symposium on Security and Privacy (SP);2023-05
3. On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing;Theory of Cryptography;2022
4. Optimally-secure Coin-tossing against a Byzantine Adversary;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12
5. Efficient Distributed Coin-tossing Protocols;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12