On the public citation graph

Quorum-based secure multi-party computation

https://doi.org/10.1007/bfb0054140
0 signed · 50 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.1002/ecjc.4430720906openalex-snapshot
Secret sharing scheme realizing general access structure
inferredcites →https://doi.org/10.1007/0-387-34799-2_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
inferredcites →https://doi.org/10.1007/3-540-46766-1_31openalex-snapshot
Foundations of Secure Interactive Computing
inferredcites →https://doi.org/10.1007/3-540-46766-1_32openalex-snapshot
Secure Computation
inferredcites →https://doi.org/10.1007/3-540-47555-9_26openalex-snapshot
Cryptographic Protocols Provably Secure Against Dynamic Adversaries
inferredcites →https://doi.org/10.1007/3-540-48184-2_10openalex-snapshot
Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)
inferredcites →https://doi.org/10.1007/bf00196771openalex-snapshot
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
inferredcites →https://doi.org/10.1007/bf01762123openalex-snapshot
Distributed match-making
inferredcites →https://doi.org/10.1007/bf01864160openalex-snapshot
Matchings and covers in hypergraphs
inferredcites →https://doi.org/10.1007/s004460050027openalex-snapshot
Crumbling walls: a class of practical and efficient quorum systems
inferredcites →https://doi.org/10.1109/12.83661openalex-snapshot
Hierarchical quorum consensus: a new algorithm for managing replicated data
inferredcites →https://doi.org/10.1109/71.238300openalex-snapshot
A theory of coteries: mutual exclusion in distributed systems
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sct.1994.315813openalex-snapshot
On ultrafilters and NP
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.1989.63520openalex-snapshot
Multiparty computation with faulty majority
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0404004openalex-snapshot
A Zero-One Law for Boolean Privacy
inferredcites →https://doi.org/10.1137/s0097539795281232openalex-snapshot
The Load, Capacity, and Availability of Quorum Systems
inferredcites →https://doi.org/10.1145/103727.103728openalex-snapshot
An efficient and fault-tolerant solution for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/195058.195405openalex-snapshot
How to share a function securely
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1145/237814.238015openalex-snapshot
Adaptively secure multi-party computation
inferredcites →https://doi.org/10.1145/238168.238209openalex-snapshot
Access control and signatures via quorum secret sharing
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/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/5505.5508openalex-snapshot
Consistency in a partitioned network: a survey
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/73007.73014openalex-snapshot
Verifiable secret sharing and multiparty protocols with honest majority

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-45539-6_22openalex-snapshot
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_37openalex-snapshot
Compressing Cryptographic Resources
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_11openalex-snapshot
Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_10openalex-snapshot
Communication-Efficient MPC for General Adversary Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_10openalex-snapshot
Reducing Communication Channels in MPC
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_19openalex-snapshot
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
inferred← citeshttps://doi.org/10.1007/s00145-010-9056-zopenalex-snapshot
On d-Multiplicative Secret Sharing
inferred← citeshttps://doi.org/10.1007/s001459910003openalex-snapshot
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s10489-022-04119-6openalex-snapshot
A two-phase random forest with differential privacy
inferred← citeshttps://doi.org/10.1109/71.722223openalex-snapshot
Access control and signatures via quorum secret sharing
inferred← citeshttps://doi.org/10.1109/iscc.2003.1214217openalex-snapshot
A secure network access protocol (SNAP)
inferred← citeshttps://doi.org/10.1137/s0895480198343819openalex-snapshot
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
inferred← citeshttps://doi.org/10.1145/2491533.2491551openalex-snapshot
Distributed computing column 50
inferred← citeshttps://doi.org/10.1145/2491533.2491553openalex-snapshot
Distributing trusted third parties
inferred← citeshttps://doi.org/10.1145/301250.301275openalex-snapshot
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
inferred← citeshttps://doi.org/10.3929/ethz-a-006119531openalex-snapshot
Generalized Corruption Models in Secure Multi-party Computation
inferred← citeshttps://doi.org/10.56553/popets-2023-0035openalex-snapshot
Multi-Party Replicated Secret Sharing over a Ring with Applications to Privacy-Preserving Machine Learning
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.