Herring is the first parallel γ-batch-order-fairness DAG BFT protocol that achieves higher saturation throughput than FairDAG-RL and DoD-W by parallelizing graph construction and piggybacking missing edge resolution on reliable broadcast.
Reiter, Guy Golan-Gueta, and Ittai Abraham
8 Pith papers cite this work, alongside 944 external citations. Polarity classification is still indexing.
8
Pith papers citing it
944
external citations · external index
representative citing papers
Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
OptChain is a sharding protocol for permissionless blockchains that approaches the theoretical upper bound on throughput by optimizing vertical and horizontal scalability while preserving security.
Integrating a blockchain-based trust/reputation model with Schnorr signatures into Raft keeps malicious leaders below 5% with under 10% throughput loss at 40% Byzantine nodes.
Ambulance uses protocol-rigged races among replicas to achieve high throughput and low latency comparable to timeout-based BFT while matching the robustness of cooperative approaches.
CPPDD is a new consensus-based protocol for privacy-preserving multi-client data sharing that achieves unanimous-release confidentiality, linear scalability, and high-probability malicious deviation detection.
citing papers explorer
-
Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus
Herring is the first parallel γ-batch-order-fairness DAG BFT protocol that achieves higher saturation throughput than FairDAG-RL and DoD-W by parallelizing graph construction and piggybacking missing edge resolution on reliable broadcast.
-
Distributed Stochastic Graph Algorithms
Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
-
A Composable Game-Theoretic Framework for Blockchains
Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.
-
Fast Byzantine Total Order Broadcast
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
-
OptChain: Achieving Optimal Throughput of Permissionless Blockchains
OptChain is a sharding protocol for permissionless blockchains that approaches the theoretical upper bound on throughput by optimizing vertical and horizontal scalability while preserving security.
-
TRM-Raft: A Byzantine-Resistant Raft Consensus via Integrated Trust and Reputation Model
Integrating a blockchain-based trust/reputation model with Schnorr signatures into Raft keeps malicious leaders below 5% with under 10% throughput loss at 40% Byzantine nodes.
-
Ambulance: saving BFT through racing
Ambulance uses protocol-rigged races among replicas to achieve high throughput and low latency comparable to timeout-based BFT while matching the robustness of cooperative approaches.
-
Secure, Verifiable, and Scalable Multi-Client Data Sharing via Consensus-Based Privacy-Preserving Data Distribution
CPPDD is a new consensus-based protocol for privacy-preserving multi-client data sharing that achieves unanimous-release confidentiality, linear scalability, and high-probability malicious deviation detection.