On expected constant-round protocols for Byzantine agreement
From MaRDI portal
(Redirected from Publication:1004599)
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
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- scientific article; zbMATH DE number 1942434 (Why is no real title available?)
- A lower bound for the time to assure interactive consistency
- An O (log n ) expected rounds randomized byzantine generals protocol
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Authenticated Algorithms for Byzantine Agreement
- Byzantine agreement in the full-information model in \(O(\log n)\) rounds
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient player-optimal protocols for strong and differential consensus
- Flipping Persuasively in Constant Time
- Foundations of Cryptography
- From partial consistency to global broadcast
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- How to share a secret
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Information-theoretically secure protocols and security under composition
- On the composition of authenticated byzantine agreement
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Reaching Agreement in the Presence of Faults
- Resilient-optimal interactive consistency in constant time
- Round-Efficient Secure Computation in Point-to-Point Networks
- Secure multi-party computation without agreement
- Sequential composition of protocols without simultaneous termination
- Simultaneous broadcast revisited
- The Byzantine Generals Problem
- The round complexity of verifiable secret sharing and secure multicast
- Theory of Cryptography
Cited in
(28)- On the round complexity of randomized Byzantine agreement
- On the round complexity of randomized Byzantine agreement
- scientific article; zbMATH DE number 176512 (Why is no real title available?)
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- On the bit security of cryptographic primitives
- Communication complexity of Byzantine agreement, revisited
- Sublinear-round Byzantine agreement under corrupt majority
- On the round complexity of fully secure solitary MPC with honest majority
- Random oracles in constantipole
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Towards permissionless consensus in the standard model via fine-grained complexity
- Decentralized asset custody scheme with security against rational adversary
- Expected constant round Byzantine broadcast under dishonest majority
- Algorand: a secure and efficient distributed ledger
- Sequential composition of protocols without simultaneous termination
- Improving the round complexity of VSS in point-to-point networks
- A strong provably secure IBE scheme without bilinear map
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- A characterization of eventual Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Authenticated Byzantine generals in dual failure model
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Round efficient Byzantine agreement from VDFs
- On Expected Constant-Round Protocols for Byzantine Agreement
- Byzantine Agreement in Expected Polynomial Time
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
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)
