On the public citation graph
Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
0 signed · 77 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11523468_17openalex-snapshot
Optimistic Asynchronous Atomic Broadcast
inferredcites →https://doi.org/10.1007/11795490_9openalex-snapshot
Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
inferredcites →https://doi.org/10.1007/3-540-44647-8_31openalex-snapshot
Secure and Efficient Asynchronous Broadcast Protocols
inferredcites →https://doi.org/10.1007/3-540-45539-6_15openalex-snapshot
Practical Threshold Signatures
inferredcites →https://doi.org/10.1007/3-540-48184-2_8openalex-snapshot
Society and Group Oriented Cryptography: a New Concept
inferredcites →https://doi.org/10.1007/3-540-60042-6_7openalex-snapshot
The Rampart toolkit for building high-integrity services
inferredcites →https://doi.org/10.1007/s00145-005-0318-0openalex-snapshot
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
inferredcites →https://doi.org/10.1007/s004460050002openalex-snapshot
Secure reliable multicast protocols in a WAN
inferredcites →https://doi.org/10.1109/dsn.2001.941404openalex-snapshot
Distributing trust on the Internet
inferredcites →https://doi.org/10.1109/dsn.2002.1028904openalex-snapshot
Quantifying the cost of providing intrusion tolerance in group communication systems
inferredcites →https://doi.org/10.1109/ftcs.1993.627344openalex-snapshot
Randomized distributed agreement revisited
inferredcites →https://doi.org/10.1109/hicss.1998.656294openalex-snapshot
The SecureRing protocols for securing group communication
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1145/167088.167105openalex-snapshot
Fast asynchronous Byzantine agreement with optimal resilience
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/571637.571640openalex-snapshot
Practical byzantine fault tolerance and proactive recovery
inferredcites →https://doi.org/10.1145/800222.806743openalex-snapshot
An asynchronous [(n - 1)/3]-resilient consensus protocol
inferredcites →https://doi.org/10.1145/98163.98167openalex-snapshot
Implementing fault-tolerant services using the state machine approach: a tutorial
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11945529_20openalex-snapshot
Robust Random Number Generation for Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-18283-9_14openalex-snapshot
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback
inferred← citeshttps://doi.org/10.1007/978-3-319-39028-4_9openalex-snapshot
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_7openalex-snapshot
On Optimal Probabilistic Asynchronous Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/978-3-642-11294-2_9openalex-snapshot
State Machine Replication with Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-981-96-1545-2_5openalex-snapshot
TP-BFT: A Faster Asynchronous BFT Consensus with Parallel Structure
inferred← citeshttps://doi.org/10.1007/s00446-023-00458-wopenalex-snapshot
Byzantine consensus is $$\Theta (n^2)$$: the Dolev-Reischuk bound is tight even in partial synchrony!
inferred← citeshttps://doi.org/10.1007/s00446-023-00459-9openalex-snapshot
Expected linear round synchronization: the missing link for linear Byzantine SMR
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.003openalex-snapshot
Robust random number generation for peer-to-peer systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.027openalex-snapshot
A deterministic worst-case message complexity optimal solution for resource discovery
inferred← citeshttps://doi.org/10.1109/acsac63791.2024.00050openalex-snapshot
Janus: Enhancing Asynchronous Common Subset with Trusted Hardware
inferred← citeshttps://doi.org/10.1109/coins49042.2020.9191430openalex-snapshot
The Hashgraph Protocol: Efficient Asynchronous BFT for High-Throughput Distributed Ledgers
inferred← citeshttps://doi.org/10.1109/dsn.2006.7openalex-snapshot
A Performance Study on the Signal-On-Fail Approach to Imposing Total Order in the Streets of Byzantium
inferred← citeshttps://doi.org/10.1109/dsn.2019.00063openalex-snapshot
SBFT: A Scalable and Decentralized Trust Infrastructure
inferred← citeshttps://doi.org/10.1109/dsn48063.2020.00058openalex-snapshot
EPIC: Efficient Asynchronous BFT with Adaptive Security
inferred← citeshttps://doi.org/10.1109/icdcs.2006.65openalex-snapshot
Practical Byzantine Group Communication
inferred← citeshttps://doi.org/10.1109/icdcs54860.2022.00032openalex-snapshot
Efficient Asynchronous Byzantine Agreement without Private Setups
inferred← citeshttps://doi.org/10.1109/icisce48695.2019.00044openalex-snapshot
Blockchain Data Provenance Scheme Based on Grouping Consensus and B-M Tree
inferred← citeshttps://doi.org/10.1109/jiot.2026.3695203openalex-snapshot
Mako: Making Reputation-Based DAG Consensus Live and Efficient for IoT Systems
inferred← citeshttps://doi.org/10.1109/saso.2008.44openalex-snapshot
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
inferred← citeshttps://doi.org/10.1109/sp.2016.38openalex-snapshot
Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
inferred← citeshttps://doi.org/10.1109/srds.2007.13openalex-snapshot
On the Latency Efficiency of Message-Parsimonious Asynchronous Atomic Broadcast
inferred← citeshttps://doi.org/10.1109/srds.2011.36openalex-snapshot
On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
inferred← citeshttps://doi.org/10.1109/srds.2014.15openalex-snapshot
The Performance of Paxos in the Cloud
inferred← citeshttps://doi.org/10.1109/tc.2024.3510620openalex-snapshot
Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFT
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3568460openalex-snapshot
MiB: Asynchronous BFT With More Replicas
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3569608openalex-snapshot
$\mathsf {JUMBO}$JUMBO: Fully Asynchronous BFT Consensus Made Truly Scalable
inferred← citeshttps://doi.org/10.1109/tdsc.2026.3663433openalex-snapshot
Customizable Information Dispersal-Based Byzantine Broadcast With Communication Optimization Using Bloom Filters
inferred← citeshttps://doi.org/10.1145/2976749.2978399openalex-snapshot
The Honey Badger of BFT Protocols
inferred← citeshttps://doi.org/10.1145/3457337.3457843openalex-snapshot
An Optimization Strategy for PBFT Consensus Mechanism Based On Consortium Blockchain
inferred← citeshttps://doi.org/10.1145/3492321.3519579openalex-snapshot
State machine replication scalability made simple
inferred← citeshttps://doi.org/10.1145/3576915.3623191openalex-snapshot
Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus
inferred← citeshttps://doi.org/10.1145/3584684openalex-snapshot
Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
inferred← citeshttps://doi.org/10.14393/ufu.di.2018.1147openalex-snapshot
Implementação e Avaliação do Protocolo de Difusão Atômica Rápida a Despeito de Colisões
inferred← citeshttps://doi.org/10.14722/ndss.2022.24385openalex-snapshot
Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice
inferred← citeshttps://doi.org/10.14778/3407790.3407847openalex-snapshot
Practical client-side replication
inferred← citeshttps://doi.org/10.14778/3734839.3734850openalex-snapshot
Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced Throughput
inferred← citeshttps://doi.org/10.2200/s00402ed1v01y201202dct009openalex-snapshot
Quorum Systems: With Applications to Storage and Consensus
inferred← citeshttps://doi.org/10.3390/app14041461openalex-snapshot
FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT Protocol
inferred← citeshttps://doi.org/10.3390/drones6080187openalex-snapshot
LAP-BFT: Lightweight Asynchronous Provable Byzantine Fault-Tolerant Consensus Mechanism for UAV Network
inferred← citeshttps://doi.org/10.3390/fintech1040025openalex-snapshot
Pravuil: Global Consensus for a United World
inferred← citeshttps://doi.org/10.4230/lipics.disc.2025.6openalex-snapshot
Hierarchical Consensus: Scalability Through Optimism and Weak Liveness
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6719openalex-snapshot
Practical Experience Report: The Performance of Paxos in the Cloud
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4241openalex-snapshot
Abstractions for asynchronous distributed computing with malicious players
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5975openalex-snapshot
Abstractions for Solving Consensus and Related Problems with Byzantine Faults
inferred← citeshttps://doi.org/10.5753/wtf.2015.22936openalex-snapshot
Um Detector de Falhas Bizantinas Assíncrono Aplicada à Computação em Nuvem
showing the first 52 of 53 · page through all 53
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.