On the public citation graph

Scaling Byzantine Fault-Tolerant Replication toWide Area Networks

0 signed · 96 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.2000.2881openalex-snapshot
Robust Threshold DSS Signatures
inferredcites →https://doi.org/10.1007/0-387-34805-0_28openalex-snapshot
Threshold cryptosystems
inferredcites →https://doi.org/10.1007/3-540-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1007/3-540-37795-6_20openalex-snapshot
Uncertainty and Predictability: Can They Be Reconciled?
inferredcites →https://doi.org/10.1007/3-540-44750-4_27openalex-snapshot
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
inferredcites →https://doi.org/10.1007/3-540-45539-6_15openalex-snapshot
Practical Threshold Signatures
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/s004460050050openalex-snapshot
Byzantine quorum systems
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1109/69.842262openalex-snapshot
An architecture for survivable coordination in large distributed systems
inferredcites →https://doi.org/10.1109/discex.2001.932165openalex-snapshot
Persistent objects in the Fleet system
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.2003.1209961openalex-snapshot
Reliable communication in overlay networks
inferredcites →https://doi.org/10.1109/dsn.2005.48openalex-snapshot
Fast Byzantine Consensus
inferredcites →https://doi.org/10.1109/hicss.1998.656294openalex-snapshot
The SecureRing protocols for securing group communication
inferredcites →https://doi.org/10.1109/reldis.1998.740474openalex-snapshot
Secure and scalable replication in Phalanx
inferredcites →https://doi.org/10.1109/reldis.2002.1180168openalex-snapshot
Efficient Byzantine-resilient reliable multicast on a hybrid failure model
inferredcites →https://doi.org/10.1109/sfcs.1987.4openalex-snapshot
A practical scheme for non-interactive verifiable secret sharing
inferredcites →https://doi.org/10.1109/srds.2007.40openalex-snapshot
Customizable Fault Tolerance forWide-Area Replication
inferredcites →https://doi.org/10.1109/tse.1985.231893openalex-snapshot
The N-Version Approach to Fault-Tolerant Software
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1145/1085126.1085127openalex-snapshot
APSS
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/1294261.1294267openalex-snapshot
Zyzzyva
inferredcites →https://doi.org/10.1145/279227.279229openalex-snapshot
The part-time parliament
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/357369.357371openalex-snapshot
Fail-stop processors
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system
inferredcites →https://doi.org/10.1145/571637.571640openalex-snapshot
Practical byzantine fault tolerance and proactive recovery
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/945469.945470openalex-snapshot
Separating agreement from execution for byzantine fault tolerant services
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.5555/296806.296824openalex-snapshot
Practical Byzantine fault tolerance

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.6813openalex-snapshot
Improved Byzantine fault tolerance with fast consensus
inferred← citeshttps://doi.org/10.1002/sec.593openalex-snapshot
Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes
inferred← citeshttps://doi.org/10.1007/978-3-031-01877-0openalex-snapshot
Fault-Tolerant Distributed Transactions on Blockchain
inferred← citeshttps://doi.org/10.1007/978-3-540-85230-8_20openalex-snapshot
Proactive RSA with Non-interactive Signing
inferred← citeshttps://doi.org/10.1007/978-3-642-05148-7_50openalex-snapshot
Proactive Byzantine Quorum Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-16161-2_18openalex-snapshot
Impossibility of Finding Any Third Family of Server Protocols Integrating Byzantine Quorum Systems with Threshold Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-35170-9_22openalex-snapshot
On the Practicality of Practical Byzantine Fault Tolerance
inferred← citeshttps://doi.org/10.1007/978-3-642-45065-5_3openalex-snapshot
Experiences with Fault-Injection in a Byzantine Fault-Tolerant Protocol
inferred← citeshttps://doi.org/10.1007/978-3-662-45921-8_32openalex-snapshot
Security Made, Not Perfect, But Automatic
inferred← citeshttps://doi.org/10.1093/comjnl/bxs148openalex-snapshot
BFT-TO: Intrusion Tolerance with Less Replicas
inferred← citeshttps://doi.org/10.1109/ccece53047.2021.9569079openalex-snapshot
The Impact of Vote Counting Policy on the Performance of PBFT: Invited Paper
inferred← citeshttps://doi.org/10.1109/ccgrid.2016.20openalex-snapshot
Medusa: An Efficient Cloud Fault-Tolerant MapReduce
inferred← citeshttps://doi.org/10.1109/dsn.2007.66openalex-snapshot
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
inferred← citeshttps://doi.org/10.1109/dsn.2008.4630088openalex-snapshot
Byzantine replication under attack
inferred← citeshttps://doi.org/10.1109/dsn.2010.5544268openalex-snapshot
Turquois: Byzantine consensus in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/dsn.2018.00017openalex-snapshot
Byzantine Fault-Tolerant Atomic Multicast
inferred← citeshttps://doi.org/10.1109/dsn.2019.00063openalex-snapshot
SBFT: A Scalable and Decentralized Trust Infrastructure
inferred← citeshttps://doi.org/10.1109/hase.2010.19openalex-snapshot
EBAWA: Efficient Byzantine Agreement for Wide-Area Networks
inferred← citeshttps://doi.org/10.1109/icmic.2018.8529940openalex-snapshot
Research on Consensus Efficiency Based on Practical Byzantine Fault Tolerance
inferred← citeshttps://doi.org/10.1109/icoin.2018.8343095openalex-snapshot
Fireplug: Flexible and robust N-version geo-replication of graph databases
inferred← citeshttps://doi.org/10.1109/skg.2018.00045openalex-snapshot
Bonus Points Alliance Based on the Block Chain
inferred← citeshttps://doi.org/10.1109/srds.2007.40openalex-snapshot
Customizable Fault Tolerance forWide-Area Replication
inferred← citeshttps://doi.org/10.1109/srds.2009.35openalex-snapshot
When and How to Change Quorums on Wide Area Networks
inferred← citeshttps://doi.org/10.1109/srds.2012.46openalex-snapshot
On the Feasibility of Byzantine Fault-Tolerant MapReduce in Clouds-of-Clouds
inferred← citeshttps://doi.org/10.1109/srds69199.2025.00040openalex-snapshot
Securing Consensus from Long-Range Attacks Through Collaboration
inferred← citeshttps://doi.org/10.1109/tc.2011.221openalex-snapshot
Efficient Byzantine Fault-Tolerance
inferred← citeshttps://doi.org/10.1109/tdsc.2008.53openalex-snapshot
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
inferred← citeshttps://doi.org/10.1109/tdsc.2010.70openalex-snapshot
Prime: Byzantine Replication under Attack
inferred← citeshttps://doi.org/10.1109/tdsc.2014.2312331openalex-snapshot
hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost
inferred← citeshttps://doi.org/10.1109/tdsc.2021.3116488openalex-snapshot
Byzantine-Resilient Multi-Agent System
inferred← citeshttps://doi.org/10.1109/tpds.2020.2981019openalex-snapshot
Fireplug: Efficient and Robust Geo-Replication of Graph Databases
inferred← citeshttps://doi.org/10.1109/tpds.2023.3239993openalex-snapshot
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
inferred← citeshttps://doi.org/10.1145/1655108.1655120openalex-snapshot
Towards secure dataflow processing in open distributed systems
inferred← citeshttps://doi.org/10.1145/1755688.1755724openalex-snapshot
RunTest
inferred← citeshttps://doi.org/10.1145/1835698.1835798openalex-snapshot
Breaking the O ( n 2 ) bit barrier
inferred← citeshttps://doi.org/10.1145/1989727.1989732openalex-snapshot
Breaking the O ( n 2 ) bit barrier
inferred← citeshttps://doi.org/10.1145/3127479.3128609openalex-snapshot
APUS
inferred← citeshttps://doi.org/10.1145/3212734.3212751openalex-snapshot
Sublinear Message Bounds for Randomized Agreement
inferred← citeshttps://doi.org/10.1145/3491003.3491005openalex-snapshot
Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits
inferred← citeshttps://doi.org/10.1145/3576915.3623080openalex-snapshot
TrustBoost: Boosting Trust among Interoperable Blockchains
inferred← citeshttps://doi.org/10.1145/3583668.3594567openalex-snapshot
On the Validity of Consensus
inferred← citeshttps://doi.org/10.1145/3662158.3662780openalex-snapshot
All Byzantine Agreement Problems Are Expensive
inferred← citeshttps://doi.org/10.1587/transinf.2016edp7036openalex-snapshot
D-Paxos: Building Hierarchical Replicated State Machine for Cloud Environments
inferred← citeshttps://doi.org/10.2200/s01068ed1v01y202012dtm065openalex-snapshot
Fault-Tolerant Distributed Transactions on Blockchain
inferred← citeshttps://doi.org/10.3390/computers6020013openalex-snapshot
Towards Trustworthy Collaborative Editing
inferred← citeshttps://doi.org/10.4018/978-1-4666-5888-2.ch276openalex-snapshot
Enhancing Service Integrity of Byzantine Fault Tolerant Applications
inferred← citeshttps://doi.org/10.4018/978-1-5225-2255-3.ch427openalex-snapshot
Intrusion Tolerance Techniques
inferred← citeshttps://doi.org/10.4018/978-1-5225-7492-7.ch021openalex-snapshot
Intrusion Tolerance Techniques
inferred← citeshttps://doi.org/10.4018/978-1-60566-026-4.ch354openalex-snapshot
Intrusion Tolerance in Information Systems
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.31openalex-snapshot
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2019.4openalex-snapshot
FairLedger: A Fair Blockchain Protocol for Financial Institutions
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.9openalex-snapshot
ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication
inferred← citeshttps://doi.org/10.4230/oasics.tokenomics.2019.9openalex-snapshot
Evaluating the Red Belly Blockchain
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4561openalex-snapshot
Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1910.08648openalex-snapshot
n-m-Variant Systems: Adversarial-Resistant Software Rejuvenation for Cloud-Based Web Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02235openalex-snapshot
FnF-BFT: Exploring Performance Limits of BFT Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.2107.13047openalex-snapshot
RingBFT: Resilient Consensus over Sharded Ring Topology
inferred← citeshttps://doi.org/10.5121/ijdps.2011.2101openalex-snapshot
Two New Protocols for Fault Tolerant Agreement
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.