On expected constant-round protocols for Byzantine agreement
From MaRDI portal
Publication:1004599
DOI10.1016/J.JCSS.2008.08.001zbMATH Open1162.68431OpenAlexW2044436778MaRDI QIDQ1004599FDOQ1004599
Authors: Chiu-Yuen Koo, Jonathan Katz 
Publication date: 11 March 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.08.001
Recommendations
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the composition of authenticated Byzantine Agreement
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- scientific article; zbMATH DE number 176512
Cites Work
- How to share a secret
- Foundations of Cryptography
- Authenticated Algorithms for Byzantine Agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Title not available (Why is that?)
- A lower bound for the time to assure interactive consistency
- The round complexity of verifiable secret sharing and secure multicast
- From partial consistency to global broadcast
- Information-theoretically secure protocols and security under composition
- Title not available (Why is that?)
- Theory of Cryptography
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Title not available (Why is that?)
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Resilient-optimal interactive consistency in constant time
- Sequential composition of protocols without simultaneous termination
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Secure multi-party computation without agreement
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Improving the Round Complexity of VSS in Point-to-Point Networks
- An O (log n ) expected rounds randomized byzantine generals protocol
- Flipping Persuasively in Constant Time
- Byzantine agreement in the full-information model in \(O(\log n)\) rounds
- Efficient player-optimal protocols for strong and differential consensus
- Title not available (Why is that?)
- On the composition of authenticated byzantine agreement
- Simultaneous broadcast revisited
- Round-Efficient Secure Computation in Point-to-Point Networks
Cited In (28)
- On Expected Constant-Round Protocols for Byzantine Agreement
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Byzantine Agreement in Expected Polynomial Time
- Authenticated Byzantine generals in dual failure model
- On the round complexity of fully secure solitary MPC with honest majority
- On the round complexity of randomized Byzantine agreement
- A strong provably secure IBE scheme without bilinear map
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- A characterization of eventual Byzantine agreement
- Expected constant round Byzantine broadcast under dishonest majority
- Random oracles in constantipole
- On the round complexity of randomized Byzantine agreement
- Decentralized asset custody scheme with security against rational adversary
- On the bit security of cryptographic primitives
- Sublinear-round Byzantine agreement under corrupt majority
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Towards permissionless consensus in the standard model via fine-grained complexity
- Algorand: a secure and efficient distributed ledger
- Title not available (Why is that?)
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Communication complexity of Byzantine agreement, revisited
- Round efficient Byzantine agreement from VDFs
- Sequential composition of protocols without simultaneous termination
- Improving the round complexity of VSS in point-to-point networks
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
This page was built for publication: On expected constant-round protocols for Byzantine agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004599)
