On the public citation graph

Efficient Byzantine agreement secure against general adversaries

https://doi.org/10.1007/bfb0056479
0 signed · 63 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.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
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/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
inferredcites →https://doi.org/10.1145/167088.167101openalex-snapshot
Fully polynomial Byzantine agreement in t + 1 rounds
inferredcites →https://doi.org/10.1145/258533.258650openalex-snapshot
Byzantine quorum systems
inferredcites →https://doi.org/10.1145/259380.259412openalex-snapshot
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
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/41840.41844openalex-snapshot
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
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/62212.62225openalex-snapshot
Optimal algorithms for Byzantine agreement
inferredcites →https://doi.org/10.7146/brics.v4i28.18954openalex-snapshot
Span Programs and General Secure Multi-Party Computation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36413-7_2openalex-snapshot
Secure Multi-party Computation Made Simple
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_25openalex-snapshot
Trading Players for Efficiency in Unconditional Multiparty Computation
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_37openalex-snapshot
Efficient Multi-party Computation over Rings
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_4openalex-snapshot
Two-Threshold Broadcast and Detectable Multi-party Computation
inferred← citeshttps://doi.org/10.1007/3-540-44495-5_12openalex-snapshot
Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_22openalex-snapshot
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_36openalex-snapshot
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_9openalex-snapshot
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_2openalex-snapshot
Introduction to Secure Computation
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_2openalex-snapshot
Multiparty Computation, an Introduction
inferred← citeshttps://doi.org/10.1007/978-3-031-22912-1_10openalex-snapshot
Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-031-48618-0_3openalex-snapshot
Network Agnostic MPC with Statistical Security
inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_12openalex-snapshot
Consensus in the Presence of Overlapping Faults and Total Omission
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_27openalex-snapshot
Towards a Theory of Consistency Primitives
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_32openalex-snapshot
On Byzantine Agreement over (2,3)-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_19openalex-snapshot
General Adversaries in Unconditional Multi-party Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-68947-8openalex-snapshot
Dependability metrics: advanced lectures
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_14openalex-snapshot
MPC vs. SFE: Perfect Security in a Unified Corruption Model
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_17openalex-snapshot
Realistic Failures in Secure Multi-party Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_6openalex-snapshot
The Disagreement Power of an Adversary
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_10openalex-snapshot
On Composability of Reliable Unicast and Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_12openalex-snapshot
Authenticated Byzantine Generals in Dual Failure Model
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_24openalex-snapshot
Player-Centric Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_38openalex-snapshot
Byzantine Agreement Using Partial Authentication
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_32openalex-snapshot
Accurate Byzantine Agreement with Feedback
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_28openalex-snapshot
Active Security in Multiparty Computation over Black-Box Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_11openalex-snapshot
Efficient Multiparty Protocols via Log-Depth Threshold Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_10openalex-snapshot
Efficient General-Adversary Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_8openalex-snapshot
Reliable Broadcast with Respect to Topology Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_56openalex-snapshot
Broadcast from Minicast Secure Against General Adversaries
inferred← citeshttps://doi.org/10.1007/s00145-023-09457-3openalex-snapshot
Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries
inferred← citeshttps://doi.org/10.1007/s001459910003openalex-snapshot
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s00446-010-0122-4openalex-snapshot
The disagreement power of an adversary
inferred← citeshttps://doi.org/10.1007/s00446-016-0279-6openalex-snapshot
Reliable broadcast with respect to topology knowledge
inferred← citeshttps://doi.org/10.1007/s10773-019-04035-5openalex-snapshot
Quantum Byzantine Agreement with Tripartite Entangled States
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.01.006openalex-snapshot
Survey on blockchain for Internet of Things
inferred← citeshttps://doi.org/10.1016/j.dam.2005.03.020openalex-snapshot
Secure multi-party computation made simple
inferred← citeshttps://doi.org/10.1017/cbo9781107337756openalex-snapshot
Secure Multiparty Computation and Secret Sharing
inferred← citeshttps://doi.org/10.1109/dsn.2001.941404openalex-snapshot
Distributing trust on the Internet
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209914openalex-snapshot
Reliable broadcast in a computational hybrid model with Byzantine faults, crashes, and recoveries
inferred← citeshttps://doi.org/10.1109/ipdps.2011.57openalex-snapshot
The Weighted Byzantine Agreement Problem
inferred← citeshttps://doi.org/10.1109/srds.2006.44openalex-snapshot
Solving Consensus Using Structural Failure Models
inferred← citeshttps://doi.org/10.1109/tit.2024.3470513openalex-snapshot
Network Agnostic Perfectly Secure Multiparty Computation Against General Adversaries
inferred← citeshttps://doi.org/10.1145/1582716.1582769openalex-snapshot
The disagreement power of an adversary
inferred← citeshttps://doi.org/10.1145/1993806.1993840openalex-snapshot
Accurate byzantine agreement with feedback
inferred← citeshttps://doi.org/10.1145/2332432.2332491openalex-snapshot
On the price of equivocation in byzantine agreement
inferred← citeshttps://doi.org/10.1145/335305.335343openalex-snapshot
On the complexity of verifiable secret sharing and multiparty computation
inferred← citeshttps://doi.org/10.1145/872035.872065openalex-snapshot
Distributed consensus in the presence of sectional faults
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.4230/lipics.aft.2025.13openalex-snapshot
A New Look at Composition of Authenticated Byzantine Generals
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.