Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference36 articles.
1. Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous byzantine agreement with expected $$O(1)$$ rounds, expected $$O(n^2)$$ communication, and optimal resilience. In: Financial Crypto (2019)
2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals. Simulations and Advanced Topics. Wiley, New York (2004)
3. Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: PODC (1983)
4. Bhangale, A., Liu-Zhang, C.D., Loss, J., Nayak, K.: Efficient adaptively-secure byzantine agreement for long messages. Cryptology ePrint Archive, Report 2021/1403 (2021). https://ia.cr/2021/1403
5. Bitansky, N.: Verifiable random functions from non-interactive witness-indistinguishable proofs. In: Theory of Cryptography, pp. 567–594 (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Analyzing the Real-World Security of the Algorand Blockchain;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15