On the public citation graph

Self-Masking for Hardening Inversions1

https://doi.org/10.2139/ssrn.4536622
0 signed · 12 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/3-540-39568-7_27openalex-extracted
Breaking Iterated Knapsacks
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_2openalex-extracted
Solving Low Density Knapsacks
inferredcites →https://doi.org/10.1007/978-3-642-11799-2_23openalex-extracted
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
inferredcites →https://doi.org/10.1007/bf00189260openalex-extracted
Efficient cryptographic schemes provably as secure as subset sum
inferredcites →https://doi.org/10.1007/bf01201999openalex-extracted
Improved low-density subset sum algorithms
inferredcites →https://doi.org/10.1007/s11786-017-0297-1openalex-extracted
Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons
inferredcites →https://doi.org/10.1016/j.tcs.2016.04.032openalex-extracted
Magnifying computing gaps
inferredcites →https://doi.org/10.1109/tit.1978.1055927openalex-extracted
Hiding information and signatures in trapdoor knapsacks
inferredcites →https://doi.org/10.1109/tit.1984.1056964openalex-extracted
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-extracted
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/2455.2461openalex-extracted
Solving low-density subset sum problems
inferredcites →https://doi.org/10.1090/psapm/042/1095552openalex-snapshot
The rise and fall of knapsack cryptosystems
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.