On the public citation graph
Practical Byzantine Group Communication
0 signed · 55 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/11572329_17openalex-snapshot
Parsimony-Based Approach for Obtaining Resource-Efficient and Trustworthy Execution
inferredcites →https://doi.org/10.1007/11795490_9openalex-snapshot
Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
inferredcites →https://doi.org/10.1007/3-540-37795-6_4openalex-snapshot
Lower Bounds for Asynchronous Consensus
inferredcites →https://doi.org/10.1007/3-540-48254-7_7openalex-snapshot
Muteness Failure Detectors: Specification and Implementation
inferredcites →https://doi.org/10.1007/3-540-63343-x_35openalex-snapshot
Building secure and reliable network applications
inferredcites →https://doi.org/10.1007/3-540-64359-1_730openalex-snapshot
Affordable fault tolerance through adaptation
inferredcites →https://doi.org/10.1007/bfb0042323openalex-snapshot
The state machine approach: A tutorial
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/s00446-004-0110-7openalex-snapshot
Low complexity Byzantine-resilient consensus
inferredcites →https://doi.org/10.1016/0196-6774(90)90019-bopenalex-snapshot
Automatically increasing the fault-tolerance of distributed algorithms
inferredcites →https://doi.org/10.1016/b978-012373566-9.50019-7openalex-snapshot
Secure Group Communication
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/dsn.2005.42openalex-snapshot
Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks
inferredcites →https://doi.org/10.1109/fits.2003.1264937openalex-snapshot
Formal specification and verification of a group membership protocol for an intrusion-tolerant group communication system
inferredcites →https://doi.org/10.1109/hpdc.1997.626423openalex-snapshot
Packing messages as a tool for boosting the performance of total ordering protocols
inferredcites →https://doi.org/10.1109/icdcs.2000.840945openalex-snapshot
Secure group communication in asynchronous networks with failures: integration and experiments
inferredcites →https://doi.org/10.1109/icdsn.2000.857550openalex-snapshot
From crash fault-tolerance to arbitrary-fault tolerance: towards a modular approach
inferredcites →https://doi.org/10.1109/mdso.2006.2openalex-snapshot
Distributed wisdom: analyzing distributed-system performance - latency vs. throughput
inferredcites →https://doi.org/10.1109/reldis.1996.559711openalex-snapshot
Strong and weak virtual synchrony in Horus
inferredcites →https://doi.org/10.1109/tdsc.2005.13openalex-snapshot
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
inferredcites →https://doi.org/10.1109/tdsc.2007.2openalex-snapshot
A Parsimonious Approach for Obtaining Resource-Efficient and Trustworthy Execution
inferredcites →https://doi.org/10.1109/tpds.2002.1036070openalex-snapshot
Scalable stability detection using logical hypercube
inferredcites →https://doi.org/10.1145/1095809.1095816openalex-snapshot
BAR fault tolerance for cooperative services
inferredcites →https://doi.org/10.1145/1095809.1095817openalex-snapshot
Fault-scalable Byzantine fault-tolerant services
inferredcites →https://doi.org/10.1145/1165389.945470openalex-snapshot
Separating agreement from execution for byzantine fault tolerant services
inferredcites →https://doi.org/10.1145/167088.167105openalex-snapshot
Fast asynchronous Byzantine agreement with optimal resilience
inferredcites →https://doi.org/10.1145/227210.227228openalex-snapshot
Distributing trust with the Rampart toolkit
inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/248052.248120openalex-snapshot
On the impossibility of group membership
inferredcites →https://doi.org/10.1145/259380.259501openalex-snapshot
Failure detectors in omission failure environments
inferredcites →https://doi.org/10.1145/277697.277772openalex-snapshot
Muteness Detectors for Consensus with Byzantine Processes (Brief Announcement)
inferredcites →https://doi.org/10.1145/503112.503113openalex-snapshot
Group communication specifications
inferredcites →https://doi.org/10.1145/503339.503341openalex-snapshot
The SecureRing group communication system
inferredcites →https://doi.org/10.1145/571637.571640openalex-snapshot
Practical byzantine fault tolerance and proactive recovery
inferredcites →https://doi.org/10.1145/62212.62225openalex-snapshot
Optimal algorithms for Byzantine agreement
inferredcites →https://doi.org/10.1145/800222.806743openalex-snapshot
An asynchronous [(n - 1)/3]-resilient consensus protocol
inferredcites →https://doi.org/10.1145/800222.806744openalex-snapshot
Randomized Byzantine Agreements
inferredcites →https://doi.org/10.1201/9781420062229openalex-snapshot
Ad Hoc Mobile Wireless Networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2277openalex-snapshot
Chameleon – a group communication framework for smartphones
inferred← citeshttps://doi.org/10.1002/spe.848openalex-snapshot
Experiences with building an intrusion‐tolerant group communication system
inferred← citeshttps://doi.org/10.1007/11914952_31openalex-snapshot
Using Selective Acknowledgements to Reduce the Memory Footprint of Replicated Services
inferred← citeshttps://doi.org/10.1109/dsn.2008.4630088openalex-snapshot
Byzantine replication under attack
inferred← citeshttps://doi.org/10.1109/srds.2006.8openalex-snapshot
Adaptive Batching for Replicated Servers
inferred← citeshttps://doi.org/10.1109/srds.2007.33openalex-snapshot
The Fail-Heterogeneous Architectural Model
inferred← citeshttps://doi.org/10.1109/srds.2007.40openalex-snapshot
Customizable Fault Tolerance forWide-Area Replication
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/tdsc.2008.76openalex-snapshot
RITAS: Services for Randomized Intrusion Tolerance
inferred← citeshttps://doi.org/10.1109/tdsc.2010.70openalex-snapshot
Prime: Byzantine Replication under Attack
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2019.4openalex-snapshot
FairLedger: A Fair Blockchain Protocol for Financial Institutions
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5975openalex-snapshot
Abstractions for Solving Consensus and Related Problems with Byzantine Faults
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.