On the public citation graph
Clocked adversaries for hashing
0 signed · 31 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.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1109/2.73openalex-snapshot
Multicomputers: message-passing concurrent computers
inferredcites →https://doi.org/10.1109/sfcs.1984.715913openalex-snapshot
How To Share Memory In A Distributed System
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1109/tc.1985.6312198openalex-snapshot
“Hot spot” contention and combining in multistage interconnection networks
inferredcites →https://doi.org/10.1145/12130.12146openalex-snapshot
Parallel hashing---an efficient implementation of shared memory
inferredcites →https://doi.org/10.21236/ada327912openalex-snapshot
How to Share Memory in a Distributed System.
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-45741-3_2openalex-snapshot
More Practical and Secure History-Independent Hash Tables
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_7openalex-snapshot
Dynamic Hashing in Real Time
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_11openalex-snapshot
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
inferred← citeshttps://doi.org/10.1007/978-3-642-20499-9_8openalex-snapshot
Optimizing Resource Sharing in Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_28openalex-snapshot
Bloom Filters in Adversarial Environments
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00292-8openalex-snapshot
Fast rehashing in PRAM emulations
inferred← citeshttps://doi.org/10.1109/atnac.2007.4665307openalex-snapshot
An attack-resistant hashing scheme
inferred← citeshttps://doi.org/10.1109/eurosp53844.2022.00018openalex-snapshot
HyperLogLog: Exponentially Bad in Adversarial Settings
inferred← citeshttps://doi.org/10.1109/focs.2010.80openalex-snapshot
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
inferred← citeshttps://doi.org/10.1109/spdp.1993.395475openalex-snapshot
Fast rehashing in PRAM emulations
inferred← citeshttps://doi.org/10.1145/3306193openalex-snapshot
Bloom Filters in Adversarial Environments
inferred← citeshttps://doi.org/10.1145/3357713.3384342openalex-snapshot
Data structures meet cryptography: 3SUM with preprocessing
inferred← citeshttps://doi.org/10.1145/3375395.3387643openalex-snapshot
The Adversarial Robustness of Sampling
inferred← citeshttps://doi.org/10.1145/3548606.3560621openalex-snapshot
Adversarial Correctness and Privacy for Probabilistic Data Structures
inferred← citeshttps://doi.org/10.1145/3714393.3726491openalex-snapshot
Probabilistic Data Structures in the Wild: A Security Analysis of Redis
inferred← citeshttps://doi.org/10.14257/ijgdc.2017.10.11.08openalex-snapshot
Identifying Open Research Problems in Cryptography by Surveying Cryptographic Functions and Operations
inferred← citeshttps://doi.org/10.23919/cnsm50824.2020.9269076openalex-snapshot
Pollution Attacks on Counting Bloom Filters for Black Box Adversaries
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05566openalex-snapshot
Naughton's Wisconsin Bibliography: A Brief Guide
inferred← citeshttps://doi.org/10.70675/fa65e8c1z1f4bz4bc9zb73az5a5bf9600e74openalex-snapshot
Constructions pour la cryptographie à bas coût
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.