On the public citation graph

On Choosing Server- or Client-Side Solutions for BFT

0 signed · 78 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.1007/3-540-48405-1openalex-snapshot
Advances in Cryptology — CRYPTO’ 99
inferredcites →https://doi.org/10.1007/3-540-68697-5_1openalex-snapshot
Keying Hash Functions for Message Authentication
inferredcites →https://doi.org/10.1007/978-3-642-11294-2_10openalex-snapshot
Selected Results from the Latest Decade of Quorum Systems Research
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bf01786228openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/s004460050050openalex-snapshot
Byzantine quorum systems
inferredcites →https://doi.org/10.1016/0167-4048(93)90054-9openalex-snapshot
Operating system protection through program evolution
inferredcites →https://doi.org/10.1109/49.221197openalex-snapshot
Transport system architecture services for high-performance communications systems
inferredcites →https://doi.org/10.1109/cgo.2013.6494997openalex-snapshot
Profile-guided automated software diversity
inferredcites →https://doi.org/10.1109/dsn.2004.1311884openalex-snapshot
Efficient Byzantine-tolerant erasure-coded storage
inferredcites →https://doi.org/10.1109/dsn.2005.48openalex-snapshot
Fast Byzantine Consensus
inferredcites →https://doi.org/10.1109/dsn.2008.4630088openalex-snapshot
Byzantine replication under attack
inferredcites →https://doi.org/10.1109/dsn.2010.5544295openalex-snapshot
Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas
inferredcites →https://doi.org/10.1109/dsnw.2013.6615538openalex-snapshot
An intrusion-tolerant firewall design for protecting SIEM systems
inferredcites →https://doi.org/10.1109/edcc.2012.32openalex-snapshot
From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation
inferredcites →https://doi.org/10.1109/fits.2003.1264932openalex-snapshot
COCA: a secure distributed online certification authority
inferredcites →https://doi.org/10.1109/icdcs.2006.83openalex-snapshot
Tolerating Byzantine Faulty Clients in a Quorum System
inferredcites →https://doi.org/10.1109/icess.2008.13openalex-snapshot
Byzantine Fault Tolerance for Electric Power Grid Monitoring and Control
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/msst.2010.5496972openalex-snapshot
The Hadoop Distributed File System
inferredcites →https://doi.org/10.1109/reldis.1998.740474openalex-snapshot
Secure and scalable replication in Phalanx
inferredcites →https://doi.org/10.1109/reldis.1998.740509openalex-snapshot
Survivable consensus objects
inferredcites →https://doi.org/10.1109/sp.2012.41openalex-snapshot
Smashing the Gadgets: Hindering Return-Oriented Programming Using In-place Code Randomization
inferredcites →https://doi.org/10.1109/srds.2007.34openalex-snapshot
Evaluating Byzantine Quorum Systems
inferredcites →https://doi.org/10.1109/srds.2013.15openalex-snapshot
Bounded Delay in Byzantine-Tolerant State Machine Replication
inferredcites →https://doi.org/10.1109/srds.2014.16openalex-snapshot
Towards a Practical Survivable Intrusion Tolerant Replication System
inferredcites →https://doi.org/10.1109/tdsc.2006.35openalex-snapshot
Fast Byzantine Consensus
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tpds.2009.83openalex-snapshot
Highly Available Intrusion-Tolerant Services with Proactive-Reactive Recovery
inferredcites →https://doi.org/10.1109/tsg.2013.2269541openalex-snapshot
Survivable SCADA Via Intrusion-Tolerant Replication
inferredcites →https://doi.org/10.1145/1095809.1095817openalex-snapshot
Fault-scalable Byzantine fault-tolerant services
inferredcites →https://doi.org/10.1145/1111322.1111337openalex-snapshot
Network coding
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/1294261.1294269openalex-snapshot
Low-overhead byzantine fault-tolerant storage
inferredcites →https://doi.org/10.1145/1629575.1629602openalex-snapshot
Upright cluster services
inferredcites →https://doi.org/10.1145/1755913.1755950openalex-snapshot
The next 700 BFT protocols
inferredcites →https://doi.org/10.1145/1813654.1813655openalex-snapshot
Proactive obfuscation
inferredcites →https://doi.org/10.1145/2508859.2516750openalex-snapshot
PoWerStore
inferredcites →https://doi.org/10.1145/2535929openalex-snapshot
DepSky
inferredcites →https://doi.org/10.1145/279227.279229openalex-snapshot
The part-time parliament
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
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/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/502034.502037openalex-snapshot
BASE
inferredcites →https://doi.org/10.1145/502059.502037openalex-snapshot
BASE
inferredcites →https://doi.org/10.1145/571637.571638openalex-snapshot
COCA
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/844128.844130openalex-snapshot
Farsite
inferredcites →https://doi.org/10.1145/945445.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/1298455.1298473openalex-snapshot
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
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.1007/978-3-030-92708-0_3openalex-snapshot
ZERMIA - A Fault Injector Framework for Testing Byzantine Fault Tolerant Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-57186-7_42openalex-snapshot
Design of a Secure Emergency Communication System Based on Cloud for Pregnancy
inferred← citeshttps://doi.org/10.1007/978-3-319-77492-3_9openalex-snapshot
Systems Engineering Approaches
inferred← citeshttps://doi.org/10.1007/978-981-15-8462-6_77openalex-snapshot
Byzantine Fault-Tolerant Consensus Algorithm Based on the Scoring Mechanism
inferred← citeshttps://doi.org/10.1007/978-981-15-9213-3_2openalex-snapshot
A Blockchain Consensus Mechanism for Marine Data Management System
inferred← citeshttps://doi.org/10.1007/s11432-024-4431-yopenalex-snapshot
From PBFT to the present: a thorough overview of blockchain consensus protocols
inferred← citeshttps://doi.org/10.1007/s12083-017-0556-6openalex-snapshot
A resource allocation model based on double-sided combinational auctions for transparent computing
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110404openalex-snapshot
BFTDiagnosis: An automated security testing framework with malicious behavior injection for BFT protocols
inferred← citeshttps://doi.org/10.1109/bcca58897.2023.10338868openalex-snapshot
SoK: Essentials of BFT Consensus for Blockchains
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00050openalex-snapshot
ERBFT: Efficient and Robust Byzantine Fault Tolerance
inferred← citeshttps://doi.org/10.1109/ispa/iucc.2017.00024openalex-snapshot
Cssp: The Consortium Blockchain Model for Improving the Trustworthiness of Network Software Services
inferred← citeshttps://doi.org/10.1145/3320154.3320155openalex-snapshot
Analysis of Digital Currency Investment
inferred← citeshttps://doi.org/10.1145/3337821.3337885openalex-snapshot
COMBFT
inferred← citeshttps://doi.org/10.1145/3427097openalex-snapshot
Blockchains for Government
inferred← citeshttps://doi.org/10.1145/3436728openalex-snapshot
Byzantine Fault-tolerant State-machine Replication from a Systems Perspective
inferred← citeshttps://doi.org/10.1145/3503042openalex-snapshot
BFT in Blockchains: From Protocols to Use Cases
inferred← citeshttps://doi.org/10.12677/csa.2021.1112294openalex-snapshot
Blockchain-Based Network Collaborative Design Resource Sharing and Tracing Method
inferred← citeshttps://doi.org/10.14778/3641204.3641216openalex-snapshot
Towards Full Stack Adaptivity in Permissioned Blockchains
inferred← citeshttps://doi.org/10.1631/fitee.1800621openalex-snapshot
Scientific workflow execution system based on mimic defense in the cloud environment
inferred← citeshttps://doi.org/10.3390/math10020182openalex-snapshot
Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus
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.