On expected constant-round protocols for Byzantine agreement
From MaRDI portal
Publication:1004599
DOI10.1016/j.jcss.2008.08.001zbMath1162.68431OpenAlexW2044436778MaRDI QIDQ1004599
Chiu-Yuen Koo, Jonathan N. 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
Related Items
Decentralized asset custody scheme with security against rational adversary, On the bit security of cryptographic primitives, Improving the round complexity of VSS in point-to-point networks, Synchronous consensus with optimal asynchronous fallback guarantees, Algorand: a secure and efficient distributed ledger, Communication complexity of Byzantine agreement, revisited, Efficient perfectly secure computation with optimal resilience, A strong provably secure IBE scheme without bilinear map, Efficient perfectly secure computation with optimal resilience, Sublinear-round Byzantine agreement under corrupt majority, Authenticated Byzantine Generals in Dual Failure Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for the time to assure interactive consistency
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Secure multi-party computation without agreement
- Information-theoretically secure protocols and security under composition
- Byzantine agreement in the full-information model in O(log n) rounds
- Efficient player-optimal protocols for strong and differential consensus
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- From partial consistency to global broadcast
- Flipping Persuasively in Constant Time
- Improving the Round Complexity of VSS in Point-to-Point Networks
- On the composition of authenticated byzantine agreement
- An O (log n ) expected rounds randomized byzantine generals protocol
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Foundations of Cryptography
- Resilient-optimal interactive consistency in constant time
- Sequential composition of protocols without simultaneous termination
- The round complexity of verifiable secret sharing and secure multicast
- Simultaneous broadcast revisited
- Round-Efficient Secure Computation in Point-to-Point Networks
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Theory of Cryptography
