On the public citation graph

Theo ry of Cryptography (vol. # 3876) : Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings

0 signed · 24 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.1007/11681878_21openalex-snapshot
Resource Fairness and Composability of Cryptographic 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/978-3-030-56784-2_17openalex-snapshot
Incompressible Encodings
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_10openalex-snapshot
Local Non-malleable Codes in the Bounded Retrieval Model
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6openalex-snapshot
Principles of Security and Trust
inferred← citeshttps://doi.org/10.1007/978-3-319-99136-8_11openalex-snapshot
A Simple Algorithm for Estimating Distribution Parameters from $$n$$ n -Dimensional Randomized Binary Responses
inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_2openalex-snapshot
A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes
inferred← citeshttps://doi.org/10.1007/s00145-016-9231-yopenalex-snapshot
Reconciling Non-malleability with Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028550openalex-snapshot
A rate-disortion perspective on local differential privacy
inferred← citeshttps://doi.org/10.1109/sp40001.2021.00001openalex-snapshot
Manipulation Attacks in Local Differential Privacy
inferred← citeshttps://doi.org/10.1117/12.3057050openalex-snapshot
A privacy protection medical record retrieval scheme for WBAN
inferred← citeshttps://doi.org/10.1145/3448248openalex-snapshot
Trustworthy AI
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17375openalex-snapshot
Differentially Private Clustering via Maximum Coverage
inferred← citeshttps://doi.org/10.29012/jpc.775openalex-snapshot
DPSyn: Experiences in the NIST Differential Privacy Data Synthesis Challenges
inferred← citeshttps://doi.org/10.29012/jpc.782openalex-snapshot
LinkedIn's Audience Engagements API
inferred← citeshttps://doi.org/10.29012/jpc.805openalex-snapshot
The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model
inferred← citeshttps://doi.org/10.29012/jpc.v7i3.404openalex-snapshot
How Will Statistical Agencies Operate When All Data Are Private?
inferred← citeshttps://doi.org/10.32920/25412851.v1openalex-snapshot
Security of Generative Adversarial Networks
inferred← citeshttps://doi.org/10.3390/app14020586openalex-snapshot
Integration of Active Clothing with a Personal Cooling System within the NGIoT Architecture for the Improved Comfort of Construction Workers
inferred← citeshttps://doi.org/10.3390/e25040679openalex-snapshot
On the Lift, Related Privacy Measures, and Applications to Privacy–Utility Trade-Offs
inferred← citeshttps://doi.org/10.3390/e26020138openalex-snapshot
Differential Privacy Preservation for Continuous Release of Real-Time Location Data
inferred← citeshttps://doi.org/10.3390/e26110946openalex-snapshot
CURATE: Scaling-Up Differentially Private Causal Graph Discovery
inferred← citeshttps://doi.org/10.3390/electronics9091486openalex-snapshot
Differentially Private Actor and Its Eligibility Trace
inferred← citeshttps://doi.org/10.3390/math10224338openalex-snapshot
A Differential Privacy Budget Allocation Algorithm Based on Out-of-Bag Estimation in Random Forest
inferred← citeshttps://doi.org/10.4018/978-1-5225-2486-1.ch008openalex-snapshot
Privacy Preserving Data Mining on Unstructured Data
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.