Scalable agreement protocols with optimal optimistic efficiency
From MaRDI portal
Publication:6660395
DOI10.1007/978-3-031-71070-4_14MaRDI QIDQ6660395
Ilan Komargodski, Yuval Gelles
Publication date: 10 January 2025
Cites Work
- Title not available (Why is that?)
- Fast large-scale honest-majority MPC for malicious adversaries
- Must the communication graph of MPC protocols be an expander?
- Amortized complexity of information-theoretically secure MPC revisited
- Easy impossibility proofs for distributed consensus problems
- Security and composition of multiparty cryptographic protocols
- Lower bound for scalable Byzantine agreement
- Secure multi-party computation in large networks
- Security Goals and Protocol Transformations
- Authenticated Algorithms for Byzantine Agreement
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable leader election
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Secure Arithmetic Computation with No Honest Majority
- Scalable and Unconditionally Secure Multiparty Computation
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Fault Tolerance in Networks of Bounded Degree
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Foundations of Cryptography
- Communication Complexity of Byzantine Agreement, Revisited
- Fast byzantine agreement
- Breaking the O ( n 2 ) bit barrier
- Circuits resilient to additive attacks with applications to secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
- Scalable Secure Multiparty Computation
- Breaking the O(√ n)-Bit Barrier
- Levels of authentication in distributed agreement
This page was built for publication: Scalable agreement protocols with optimal optimistic efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660395)
