On the public citation graph
On the structure of the privacy hierarchy
0 signed · 36 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/bf01277955openalex-snapshot
The privacy of dense symmetric functions
inferredcites →https://doi.org/10.1090/dimacs/002/03openalex-snapshot
Perfect privacy for two-party protocols
inferredcites →https://doi.org/10.1109/fscs.1990.89552openalex-snapshot
Private computations over the integers
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sfcs.1989.63512openalex-snapshot
Privacy and communication complexity
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.1006/inco.2000.3013openalex-snapshot
On Privacy and Partition Arguments
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_13openalex-snapshot
Private Computation — k-Connected versus 1-Connected Networks
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_27openalex-snapshot
On Quantum and Approximate Privacy
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_36openalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_72openalex-snapshot
On the number of random bits in totally private computation
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_7openalex-snapshot
On Complete Primitives for Fairness
inferred← citeshttps://doi.org/10.1007/978-3-642-13657-3_22openalex-snapshot
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_23openalex-snapshot
A Zero-One Law for Secure Multi-party Computation with Ternary Outputs
inferred← citeshttps://doi.org/10.1007/s000370050025openalex-snapshot
Randomness complexity of private computation
inferred← citeshttps://doi.org/10.1007/s00145-005-0329-xopenalex-snapshot
Private Computation: k-Connected versus 1-Connected Networks
inferred← citeshttps://doi.org/10.1007/s00224-003-1113-7openalex-snapshot
Quantum and Approximate Privacy
inferred← citeshttps://doi.org/10.1109/aamas.2004.1openalex-snapshot
(Im)Possibility of Unconditionally Privacy-Preserving Auctions
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365743openalex-snapshot
Reducibility and completeness in multi-party private computations
inferred← citeshttps://doi.org/10.1137/s0097539791194999openalex-snapshot
Private Computations over the Integers
inferred← citeshttps://doi.org/10.1137/s0097539797321742openalex-snapshot
Reducibility and Completeness in Private Computations
inferred← citeshttps://doi.org/10.1137/s089548010135274xopenalex-snapshot
Amortizing Randomness in Private Multiparty Computations
inferred← citeshttps://doi.org/10.1137/s089548019427634xopenalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1137/s0895480196306130openalex-snapshot
Randomness in Private Computations
inferred← citeshttps://doi.org/10.1145/1082473.1082528openalex-snapshot
Decentralized voting with unconditional privacy
inferred← citeshttps://doi.org/10.1145/1330332.1330338openalex-snapshot
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
inferred← citeshttps://doi.org/10.1145/1835804.1835867openalex-snapshot
Collusion-resistant privacy-preserving data mining
inferred← citeshttps://doi.org/10.1145/248052.248089openalex-snapshot
Randomness in private computations
inferred← citeshttps://doi.org/10.1145/277697.277710openalex-snapshot
Amortizing randomness in private multiparty computations
inferred← citeshttps://doi.org/10.3233/978-1-61499-169-4-249openalex-snapshot
Complexity of Multi-Party Computation Functionalities
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.