On the public citation graph
Tolerating Byzantine Faulty Clients in a Quorum System
0 signed · 47 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/978-3-540-30186-8_29openalex-snapshot
Non-skipping Timestamps for Byzantine Data Storage Systems
inferredcites →https://doi.org/10.1109/dsn.2004.1311884openalex-snapshot
Efficient Byzantine-tolerant erasure-coded storage
inferredcites →https://doi.org/10.1109/dsn.2006.56openalex-snapshot
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
inferredcites →https://doi.org/10.1109/reldis.1998.740474openalex-snapshot
Secure and scalable replication in Phalanx
inferredcites →https://doi.org/10.1109/reldis.2003.1238090openalex-snapshot
Sharing memory with semi-Byzantine clients and faulty storage servers
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
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-319-19848-4_5openalex-snapshot
Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_31openalex-snapshot
Probabilistic Opaque Quorum Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_14openalex-snapshot
On the Time-Complexity of Robust and Amnesic Storage
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_19openalex-snapshot
Efficient Robust Storage Using Secret Tokens
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-11294-2_10openalex-snapshot
Selected Results from the Latest Decade of Quorum Systems Research
inferred← citeshttps://doi.org/10.1007/s11227-010-0536-6openalex-snapshot
Dynamic hybrid replication effectively combining tree and grid topology
inferred← citeshttps://doi.org/10.1109/ecbs.2007.15openalex-snapshot
Adaptive Misbehavior Detection in Wireless Sensors Network Based on Local Community Agreement
inferred← citeshttps://doi.org/10.1109/icinfa.2006.374140openalex-snapshot
Byzantine Algorithms in Wireless Sensors Network
inferred← citeshttps://doi.org/10.1109/icis.2009.47openalex-snapshot
BackupIT: An Intrusion-Tolerant Cooperative Backup System
inferred← citeshttps://doi.org/10.1109/nca.2007.14openalex-snapshot
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
inferred← citeshttps://doi.org/10.1109/srds.2007.34openalex-snapshot
Evaluating Byzantine Quorum Systems
inferred← citeshttps://doi.org/10.1109/srds.2012.34openalex-snapshot
GRADE: Graceful Degradation in Byzantine Quorum Systems
inferred← citeshttps://doi.org/10.1109/tc.2009.71openalex-snapshot
An Efficient Byzantine-Resilient Tuple Space
inferred← citeshttps://doi.org/10.1109/tdsc.2010.52openalex-snapshot
Automatic Reconfiguration for Large-Scale Reliable Storage Systems
inferred← citeshttps://doi.org/10.1109/tpds.2019.2919285openalex-snapshot
Proofs of Writing for Robust Storage
inferred← citeshttps://doi.org/10.1109/tst.2015.7350015openalex-snapshot
Byzantine fault-tolerant routing for large-scale wireless sensor networks based on fast ECDSA
inferred← citeshttps://doi.org/10.1109/waina.2012.55openalex-snapshot
A Distributed IDS for Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/wi-iat.2012.16openalex-snapshot
Churn Tolerance Algorithm for State Machine Replication
inferred← citeshttps://doi.org/10.1145/1294261.1294269openalex-snapshot
Low-overhead byzantine fault-tolerant storage
inferred← citeshttps://doi.org/10.1145/1323293.1294269openalex-snapshot
Low-overhead byzantine fault-tolerant storage
inferred← citeshttps://doi.org/10.1145/1529974.1529991openalex-snapshot
Low-latency access to robust amnesic storage
inferred← citeshttps://doi.org/10.1145/2886780openalex-snapshot
On Choosing Server- or Client-Side Solutions for BFT
inferred← citeshttps://doi.org/10.26083/tuprints-00003109openalex-snapshot
Data Consistency and Coordination for Untrusted Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1212.3555openalex-snapshot
Proofs of Writing for Efficient and Robust Storage
inferred← citeshttps://doi.org/10.48550/arxiv.2105.04909openalex-snapshot
Accountability and Reconfiguration: Self-Healing Lattice Agreement
inferred← citeshttps://doi.org/10.5753/sbseg.2012.20545openalex-snapshot
Usando Criptografia de Limiar para Tolerar Clientes Maliciosos em Memória Compartilhada Dinâmica
inferred← citeshttps://doi.org/10.5753/wtf.2006.23351openalex-snapshot
Analisando o Custo do Armazenamento Tolerante a Faltas Bizantinas: PAXOS x Sistemas de Quóruns
inferred← citeshttps://doi.org/10.5753/wtf.2007.23249openalex-snapshot
Um Arcabouço de Simulação e Avaliação de Sistemas de Quóruns Bizantinos
inferred← citeshttps://doi.org/10.5753/wtf.2014.22948openalex-snapshot
Uma Solução Autonômica para a Criação de Quóruns Majoritários Baseada no Vcube
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.