scientific article; zbMATH DE number 176512
From MaRDI portal
Publication:4035678
Recommendations
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- On expected constant-round protocols for Byzantine agreement
- scientific article; zbMATH DE number 4121395
- Sublinear-round Byzantine agreement under corrupt majority
Cited in
(19)- On expected constant-round protocols for Byzantine agreement
- Sublinear-round Byzantine agreement under corrupt majority
- Byzantine agreement given partial broadcast
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Byzantine agreement in the full-information model in O( n) rounds
- Broadcast (and round) efficient verifiable secret sharing
- Player-centric Byzantine agreement
- Byzantine agreement with a rational adversary
- On complete primitives for fairness
- Flipping Persuasively in Constant Time
- Secure Protocols with Asymmetric Trust
- Efficient Byzantine Agreement with Faulty Minority
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- scientific article; zbMATH DE number 4121395 (Why is no real title available?)
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Detectable Byzantine agreement secure against faulty majorities
- Distributed Computing
- On Expected Constant-Round Protocols for Byzantine Agreement
- Multidimensional Byzantine agreement in a synchronous setting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035678)
