On the public citation graph
An optimal probabilistic algorithm for synchronous Byzantine agreement
0 signed · 54 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.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferredcites →https://doi.org/10.1016/0020-0190(84)90027-9openalex-snapshot
Extending binary Byzantine agreement to multivalued Byzantine agreement
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/s0019-9958(82)90776-8openalex-snapshot
An efficient algorithm for byzantine agreement without authentication
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sfcs.1985.14openalex-snapshot
Byzantine agreement in constant expected time
inferredcites →https://doi.org/10.1109/sfcs.1985.64openalex-snapshot
Verifiable secret sharing and achieving simultaneity in the presence of faults
inferredcites →https://doi.org/10.1109/sfcs.1986.20openalex-snapshot
Flipping persuasively in constant expected time
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
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/tit.1973.1055002openalex-snapshot
Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972)
inferredcites →https://doi.org/10.1109/tse.1985.232245openalex-snapshot
A Simple and Efficient Randomized Byzantine Agreement Algorithm
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/22145.22178openalex-snapshot
The knowledge complexity of interactive proof-systems
inferredcites →https://doi.org/10.1145/22145.22180openalex-snapshot
An O(lg n) expected rounds randomized Byzantine generals protocol
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/31846.42229openalex-snapshot
An O (log n ) expected rounds randomized byzantine generals protocol
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/323596.323610openalex-snapshot
Simple constant-time consensus protocols in realistic failure models (extended abstract)
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/65950.65956openalex-snapshot
Simple constant-time consensus protocols in realistic failure models
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)
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-91014-3_3openalex-snapshot
Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-41456-5_29openalex-snapshot
A Two-Hop Neighborhood Based Berserk Detection Algorithm for Probabilistic Model of Consensus in Distributed Ledger Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-48618-0_5openalex-snapshot
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_16openalex-snapshot
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_24openalex-snapshot
Adaptively Secure Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-662-64331-0_4openalex-snapshot
Instant Block Confirmation in the Sleepy Model
inferred← citeshttps://doi.org/10.1007/bf01187072openalex-snapshot
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
inferred← citeshttps://doi.org/10.1007/s00446-018-0342-6openalex-snapshot
Near-optimal self-stabilising counting and firing squads
inferred← citeshttps://doi.org/10.1007/s12083-009-0051-9openalex-snapshot
Peer-to-peer secure multi-party numerical computation facing malicious adversaries
inferred← citeshttps://doi.org/10.1007/s12243-021-00875-7openalex-snapshot
Voting-based probabilistic consensuses and their applications in distributed ledgers
inferred← citeshttps://doi.org/10.1007/s12243-022-00908-9openalex-snapshot
Special issue on blockchain networks and distributed protocols
inferred← citeshttps://doi.org/10.1007/s12652-021-03591-1openalex-snapshot
BSSFFS: blockchain-based sybil-secured smart forest fire surveillance
inferred← citeshttps://doi.org/10.1016/j.bcra.2021.100007openalex-snapshot
Robustness and efficiency of voting consensus protocols within byzantine infrastructures
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.09.002openalex-snapshot
FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.001openalex-snapshot
Algorand: A secure and efficient distributed ledger
inferred← citeshttps://doi.org/10.1109/icpads53394.2021.00097openalex-snapshot
Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage
inferred← citeshttps://doi.org/10.1109/icss55994.2022.00018openalex-snapshot
Fast Probabilistic Consensus Protocol (FPC) under Different Network Topologies
inferred← citeshttps://doi.org/10.1109/msn53354.2021.00068openalex-snapshot
Publish or Perish: Defending Withholding Attack in Dfinity Consensus
inferred← citeshttps://doi.org/10.1145/1146381.1146407openalex-snapshot
Optimally efficient multi-valued byzantine agreement
inferred← citeshttps://doi.org/10.1145/1400751.1400802openalex-snapshot
Fast self-stabilizing byzantine tolerant digital clock synchronization
inferred← citeshttps://doi.org/10.1145/3339471openalex-snapshot
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
inferred← citeshttps://doi.org/10.1504/ijact.2010.038309openalex-snapshot
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
inferred← citeshttps://doi.org/10.2478/popets-2021-0064openalex-snapshot
SoK: Privacy-Preserving Computation Techniques for Deep Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1608.00214openalex-snapshot
Near-Optimal Self-Stabilising Counting and Firing Squads
inferred← citeshttps://doi.org/10.48550/arxiv.1907.07248openalex-snapshot
Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks
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.