On the public citation graph

The Hardness of Being Private

0 signed · 32 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/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/3-540-45841-7_27openalex-snapshot
On Quantum and Approximate Privacy
inferredcites →https://doi.org/10.1007/978-3-642-24829-0_6openalex-snapshot
On Communication Protocols That Compute Almost Privately
inferredcites →https://doi.org/10.1007/bf00195209openalex-snapshot
On the structure of the privacy hierarchy
inferredcites →https://doi.org/10.1016/j.jcss.2003.11.006openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1016/j.tcs.2012.07.008openalex-snapshot
On communication protocols that compute almost privately
inferredcites →https://doi.org/10.1017/cbo9780511574948openalex-snapshot
Communication Complexity
inferredcites →https://doi.org/10.1109/sfcs.1982.38openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1989.63512openalex-snapshot
Privacy and communication complexity
inferredcites →https://doi.org/10.1109/sfcs.2001.959901openalex-snapshot
Informational complexity and the direct sum problem for simultaneous message complexity
inferredcites →https://doi.org/10.1109/sfcs.2002.1181944openalex-snapshot
An information statistics approach to data stream and communication complexity
inferredcites →https://doi.org/10.1137/100811969openalex-snapshot
How to Compress Interactive Communication
inferredcites →https://doi.org/10.1145/1330332.1330338openalex-snapshot
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
inferredcites →https://doi.org/10.1145/1806689.1806701openalex-snapshot
How to compress interactive communication
inferredcites →https://doi.org/10.1145/1807342.1807369openalex-snapshot
Approximate privacy
inferredcites →https://doi.org/10.1145/2213977.2214025openalex-snapshot
Interactive information complexity
inferredcites →https://doi.org/10.1145/73007.73013openalex-snapshot
A zero-one law for Boolean privacy
inferredcites →https://doi.org/10.48550/arxiv.0910.5714openalex-snapshot
Approximate Privacy: Foundations and Quantification
inferredcites →https://doi.org/10.48550/arxiv.1001.3388openalex-snapshot
Approximate Privacy: PARs for Set Problems

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-319-04268-8_5openalex-snapshot
New Lower Bounds for Privacy in Communication Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_16openalex-snapshot
Information Lower Bounds via Self-reducibility
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_9openalex-snapshot
Computing (and Life) Is All about Tradeoffs
inferred← citeshttps://doi.org/10.1007/s00224-015-9655-zopenalex-snapshot
Information Lower Bounds via Self-Reducibility
inferred← citeshttps://doi.org/10.1007/s00453-016-0163-6openalex-snapshot
Certifying Equality With Limited Interaction
inferred← citeshttps://doi.org/10.1109/ccc.2012.41openalex-snapshot
Communication Complexity and Information Complexity: Foundations and New Directions
inferred← citeshttps://doi.org/10.1109/focs.2012.68openalex-snapshot
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
inferred← citeshttps://doi.org/10.1109/focs.2013.77openalex-snapshot
A Tight Bound for Set Disjointness in the Message-Passing Model
inferred← citeshttps://doi.org/10.1145/2601067openalex-snapshot
Approximate Privacy
inferred← citeshttps://doi.org/10.1145/2601068openalex-snapshot
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
inferred← citeshttps://doi.org/10.1145/2688073.2688074openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
inferred← citeshttps://doi.org/10.1145/2746539.2746548openalex-snapshot
An Interactive Information Odometer and Applications
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.