On the public citation graph
A zero-one law for Boolean privacy
0 signed · 68 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.1109/sfcs.1984.715908openalex-snapshot
Probabilistic Communication Complexity
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11888727_16openalex-snapshot
On Correctness and Privacy in Distributed Mechanisms
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_5openalex-snapshot
Security with Low Communication Overhead
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_5openalex-snapshot
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_2openalex-snapshot
Generation of Shared RSA Keys by Two Parties
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_15openalex-snapshot
Strong verifiable secret sharing extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_67openalex-snapshot
Privacy for multi-party protocols
inferred← citeshttps://doi.org/10.1007/978-1-4612-2192-0_4openalex-snapshot
Privacy-Preserving Protocols
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_30openalex-snapshot
The Varieties of Secure Distributed Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-03810-6_10openalex-snapshot
Best Possible Information-Theoretic MPC
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_20openalex-snapshot
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_15openalex-snapshot
MHz2k: MPC from HE over $$\mathbb {Z}_{2^k}$$ with New Packing, Simpler Reshare, and Better ZKP
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_2openalex-snapshot
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
inferred← citeshttps://doi.org/10.1007/978-3-031-15255-9_11openalex-snapshot
Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_12openalex-snapshot
Randomized Functions with High Round Complexity
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_16openalex-snapshot
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-032-07089-0_2openalex-snapshot
Secure Computation: A Primer
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_15openalex-snapshot
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
inferred← citeshttps://doi.org/10.1007/978-3-540-88313-5_13openalex-snapshot
Sharemind: A Framework for Fast Privacy-Preserving Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_15openalex-snapshot
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_16openalex-snapshot
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_32openalex-snapshot
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_29openalex-snapshot
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_2openalex-snapshot
Identifying Cheaters without an Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-30428-6_9openalex-snapshot
A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_39openalex-snapshot
A Discrepancy Lower Bound for Information Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_13openalex-snapshot
Network Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/bf00196771openalex-snapshot
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
inferred← citeshttps://doi.org/10.1007/bf01096271openalex-snapshot
Mathematical problems in cryptology
inferred← citeshttps://doi.org/10.1007/bfb0020424openalex-snapshot
Secure distributed computing: Theory and practice
inferred← citeshttps://doi.org/10.1007/s00145-004-0135-xopenalex-snapshot
Adaptive versus Non-Adaptive Security of Multi-Party Protocols
inferred← citeshttps://doi.org/10.1007/s00145-005-0419-9openalex-snapshot
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions
inferred← citeshttps://doi.org/10.1007/s001459910003openalex-snapshot
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/s00453-015-0093-8openalex-snapshot
A Discrepancy Lower Bound for Information Complexity
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90120-xopenalex-snapshot
A communication-privacy tradeoff for modular addition
inferred← citeshttps://doi.org/10.1016/j.datak.2009.04.006openalex-snapshot
Impossibility of unconditionally secure scalar products
inferred← citeshttps://doi.org/10.1109/aamas.2004.1openalex-snapshot
(Im)Possibility of Unconditionally Privacy-Preserving Auctions
inferred← citeshttps://doi.org/10.1109/fscs.1990.89552openalex-snapshot
Private computations over the integers
inferred← citeshttps://doi.org/10.1109/sct.1990.113954openalex-snapshot
Privacy, additional information, and communication
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63512openalex-snapshot
Privacy and communication complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63520openalex-snapshot
Multiparty computation with faulty majority
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366820openalex-snapshot
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365743openalex-snapshot
Reducibility and completeness in multi-party private computations
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3381959openalex-snapshot
Application of Randomness for Security and Privacy in Multi-Party Computation
inferred← citeshttps://doi.org/10.1109/tkde.2012.61openalex-snapshot
Incentive Compatible Privacy-Preserving Data Analysis
inferred← citeshttps://doi.org/10.1145/103418.103475openalex-snapshot
A general completeness theorem for two party games
inferred← citeshttps://doi.org/10.1145/1082473.1082528openalex-snapshot
Decentralized voting with unconditional privacy
inferred← citeshttps://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferred← citeshttps://doi.org/10.1145/1330332.1330338openalex-snapshot
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
inferred← citeshttps://doi.org/10.1145/138027.138036openalex-snapshot
Perfectly secure message transmission
inferred← citeshttps://doi.org/10.1145/195058.195408openalex-snapshot
A minimal model for secure computation (extended abstract)
inferred← citeshttps://doi.org/10.1145/237814.237996openalex-snapshot
Correlated pseudorandomness and the complexity of private computations
inferred← citeshttps://doi.org/10.1145/2554797.2554801openalex-snapshot
Limits of random oracles in secure computation
inferred← citeshttps://doi.org/10.1145/259380.259412openalex-snapshot
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
inferred← citeshttps://doi.org/10.1145/3564246.3585228openalex-snapshot
The Round Complexity of Statistical MPC with Optimal Resiliency
inferred← citeshttps://doi.org/10.26483/ijarcs.v2i1.245openalex-snapshot
Secure Sharing Of Private Data Using Privacy- Preserving Data Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2294openalex-snapshot
A General Framework for Privacy-Preserving Distributed Greedy Algorithm
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.