Hybrid consensus: efficient consensus in the permissionless model
From MaRDI portal
Publication:6487515
Recommendations
Cited in
(25)- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- On the round complexity of randomized Byzantine agreement
- Thunderella: blockchains with optimistic instant confirmation
- Permissionless consensus in the resource model
- Sliding window challenge process for congestion detection
- Consensus on demand
- The role of a-priori information in networks of rational agents
- FAST: fair auctions via secret transactions
- Consensus from signatures of work
- Towards permissionless consensus in the standard model via fine-grained complexity
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Order-fairness for Byzantine consensus
- Byzantine generals in the permissionless setting
- Fair delivery of decentralised randomness beacon
- Formalizing delayed adaptive corruptions and the security of flooding networks
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Synchronous consensus with optimal asynchronous fallback guarantees
- MPC with synchronous security and asynchronous responsiveness
- Practical provably secure flooding for blockchains
- The sleepy model of consensus
- Shielded computations in smart contracts overcoming forks
- Weight-based Nakamoto-style blockchains
- Blockchain CAP theorem allows user-dependent adaptivity and finality
- Instant block confirmation in the sleepy model
- High-threshold AVSS with optimal communication complexity
This page was built for publication: Hybrid consensus: efficient consensus in the permissionless model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487515)
