Secure and efficient asynchronous broadcast protocols. (Extended abstract)
From MaRDI portal
Recommendations
Cited in
(43)- Byzantine-tolerant causal broadcast
- Order-fairness for Byzantine consensus
- Making Byzantine consensus live
- The consensus number of a cryptocurrency
- Crash-tolerant causal broadcast in \(O(n)\) messages
- Probabilistic termination and composability of cryptographic protocols
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Wendy grows up: more order fairness
- Communication complexity of Byzantine agreement, revisited
- Probabilistic Termination and Composability of Cryptographic Protocols
- Non-determinism in Byzantine fault-tolerant replication
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- Communication optimal multi-valued asynchronous broadcast protocol
- scientific article; zbMATH DE number 1950674 (Why is no real title available?)
- Efficient Simultaneous Broadcast
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Automata, Languages and Programming
- Quick order fairness
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Network-agnostic security comes (almost) for free in DKG and MPC
- On the Validity of Consensus
- Making Byzantine consensus live
- Improved extension protocols for Byzantine broadcast and agreement
- Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Proof of availability and retrieval in a modular blockchain architecture
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Universal composable transaction serialization with order fairness
- Information theoretic HotStuff
- Universally composable transaction order fairness: refined definitions and adaptive security
- MiniCast: minimizing the communication complexity of reliable broadcast
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Swiper: a new paradigm for efficient weighted distributed protocols
- Probabilistic Byzantine fault tolerance
- All Byzantine agreement problems are expensive
- BBCA-\textsc{Chain}: low latency, high throughput BFT consensus on a DAG
- Correctness and fairness of committee-based blockchains: a case study of Tendermint's repeated consensus
- Synchronous distributed key generation without broadcasts
- Rational censorship attack: breaking blockchain with a blackboard
This page was built for publication: Secure and efficient asynchronous broadcast protocols. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785503)
