On the public citation graph
Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns
0 signed · 42 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/978-3-030-17653-2_14openalex-snapshot
Lower Bounds for Differentially Private RAMs
inferredcites →https://doi.org/10.1007/978-3-030-64375-1_16openalex-snapshot
A Lower Bound for One-Round Oblivious RAM
inferredcites →https://doi.org/10.1007/s00145-021-09392-1openalex-snapshot
Is There an Oblivious RAM Lower Bound for Online Reads?
inferredcites →https://doi.org/10.1109/dsn.2017.28openalex-snapshot
Information Leakage in Encrypted Deduplication via Frequency Analysis
inferredcites →https://doi.org/10.1109/eurosp48549.2020.00030openalex-snapshot
Practical Volume-Based Attacks on Encrypted Databases
inferredcites →https://doi.org/10.1109/sp.2013.25openalex-snapshot
ObliviStore: High Performance Oblivious Cloud Storage
inferredcites →https://doi.org/10.1109/sp.2016.20openalex-snapshot
TaoStore: Overcoming Asynchronicity in Oblivious Data Storage
inferredcites →https://doi.org/10.1109/sp.2018.00002openalex-snapshot
Improved Reconstruction Attacks on Encrypted Data Using Range Query Leakage
inferredcites →https://doi.org/10.1109/sp.2019.00015openalex-snapshot
Data Recovery on Encrypted Databases with k-Nearest Neighbor Query Leakage
inferredcites →https://doi.org/10.1109/sp.2019.00030openalex-snapshot
Learning to Reconstruct: Statistical Learning Theory and Encrypted Database Attacks
inferredcites →https://doi.org/10.1137/1.9781611975994.68openalex-snapshot
Lower Bounds for Oblivious Near-Neighbor Search
inferredcites →https://doi.org/10.1145/1807128.1807152openalex-snapshot
Benchmarking cloud serving systems with YCSB
inferredcites →https://doi.org/10.1145/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/2723372.2749455openalex-snapshot
Modular Order-Preserving Encryption, Revisited
inferredcites →https://doi.org/10.1145/2810103.2813649openalex-snapshot
Practicing Oblivious Access on Cloud Storage
inferredcites →https://doi.org/10.1145/2810103.2813651openalex-snapshot
Inference Attacks on Property-Preserving Encrypted Databases
inferredcites →https://doi.org/10.1145/2810103.2813700openalex-snapshot
Leakage-Abuse Attacks Against Searchable Encryption
inferredcites →https://doi.org/10.1145/2840728.2840761openalex-snapshot
Is There an Oblivious RAM Lower Bound?
inferredcites →https://doi.org/10.1145/2976749.2978386openalex-snapshot
Generic Attacks on Secure Outsourced Databases
inferredcites →https://doi.org/10.1145/3294052.3319695openalex-snapshot
What Storage Access Privacy is Achievable with Small Overhead?
inferredcites →https://doi.org/10.1145/3319535.3363210openalex-snapshot
Encrypted Databases: New Volume Attacks against Range Queries.
inferredcites →https://doi.org/10.1145/3433210.3453103openalex-snapshot
Low-Cost Hiding of the Query Pattern
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-031-71070-4_11openalex-snapshot
Encrypted Multi-map that Hides Query, Access, and Volume Patterns
inferred← citeshttps://doi.org/10.1007/978-981-95-5096-8_7openalex-snapshot
Structured Encryption and Distribution-Aware Leakage Suppression
inferred← citeshttps://doi.org/10.1016/j.jpdc.2026.105331openalex-snapshot
DACTOR: An adaptive AI-driven framework for secure access control and query privacy in cloud data outsourcing
inferred← citeshttps://doi.org/10.1109/icccn69946.2026.11662914openalex-snapshot
Feistel-based Shuffling for Enhancing Security in LSM Storage Systems
inferred← citeshttps://doi.org/10.1109/icdcs63083.2025.00052openalex-snapshot
HarDTAPE: Hardware Dedicated Trusted transAction Pre-Executor
inferred← citeshttps://doi.org/10.1109/icdcsw63686.2024.00007openalex-snapshot
Tutorial: Information Leakage from Cryptographic Techniques
inferred← citeshttps://doi.org/10.1145/3735546.3735858openalex-snapshot
[Vision] Towards oblivious property graph databases
inferred← citeshttps://doi.org/10.14722/ndss.2024.241211openalex-snapshot
Private Aggregate Queries to Untrusted Databases
inferred← citeshttps://doi.org/10.14778/3675034.3675038openalex-snapshot
SWAT: A System-Wide Approach to Tunable Leakage Mitigation in Encrypted Data Stores
inferred← citeshttps://doi.org/10.14778/3749646.3749707openalex-snapshot
OasisDB: An Oblivious and Scalable System for Relational Data
inferred← citeshttps://doi.org/10.14778/3811243.3811255openalex-snapshot
Enabling Index-Free Adjacency in Oblivious Graph Processing with Delayed Duplications
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.