On the public citation graph

Enhancing access privacy of range retrievals over B+-trees

0 signed · 40 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/jos.68openalex-snapshot
Bounds for the cardinality constrainedP?Cmax problem
inferredcites →https://doi.org/10.1007/3-540-36494-3_51openalex-snapshot
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem
inferredcites →https://doi.org/10.1007/3-540-44853-5_35openalex-snapshot
Hiding Traversal of Tree Structured Data from Untrusted Data Stores
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_30openalex-snapshot
Public Key Encryption with Keyword Search
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_18openalex-snapshot
Evaluating 2-DNF Formulas on Ciphertexts
inferredcites →https://doi.org/10.1007/978-3-540-74143-5_30openalex-snapshot
Deterministic and Efficiently Searchable Encryption
inferredcites →https://doi.org/10.1007/978-3-540-74143-5_4openalex-snapshot
Public Key Encryption That Allows PIR Queries
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_27openalex-snapshot
Oblivious RAM Revisited
inferredcites →https://doi.org/10.1016/b978-012722442-8/50123-3openalex-snapshot
Chip-Secured Data Access
inferredcites →https://doi.org/10.1016/b978-155860869-6/50020-2openalex-snapshot
Chip-Secured Data Access
inferredcites →https://doi.org/10.1109/icde.2002.994695openalex-snapshot
Providing database as a service
inferredcites →https://doi.org/10.1109/secpri.2000.848445openalex-snapshot
Practical techniques for searches on encrypted data
inferredcites →https://doi.org/10.1109/sfcs.1995.492461openalex-snapshot
Private information retrieval
inferredcites →https://doi.org/10.1145/1007568.1007632openalex-snapshot
Order preserving encryption for numeric data
inferredcites →https://doi.org/10.1145/1180405.1180417openalex-snapshot
Searchable symmetric encryption
inferredcites →https://doi.org/10.1145/1455770.1455790openalex-snapshot
Building castles out of mud
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/30401.30404openalex-snapshot
Processing encrypted data
inferredcites →https://doi.org/10.1145/356770.356776openalex-snapshot
Ubiquitous B-Tree
inferredcites →https://doi.org/10.1145/564691.564717openalex-snapshot
Executing SQL over encrypted data in the database-service-provider model
inferredcites →https://doi.org/10.1145/948109.948124openalex-snapshot
Balancing confidentiality and efficiency in untrusted relational DBMSs
inferredcites →https://doi.org/10.1145/948121.948124openalex-snapshot
Balancing confidentiality and efficiency in untrusted relational DBMSs
inferredcites →https://doi.org/10.1147/rd.483.0475openalex-snapshot
The IBM PCIXCC: A new cryptographic coprocessor for the IBM eServer
inferredcites →https://doi.org/10.1201/9781439894699-15openalex-snapshot
Advanced Encryption Standard
inferredcites →https://doi.org/10.1287/moor.21.1.85openalex-snapshot
The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
inferredcites →https://doi.org/10.14778/1920841.1920920openalex-snapshot
Nearest neighbor search with strong location privacy
inferredcites →https://doi.org/10.5220/0002685203140323openalex-snapshot
Hiding Traversal of Tree Structured Data from Untrusted Data Stores
inferredcites →https://doi.org/10.5555/1182635.1164140openalex-snapshot
Efficient secure query evaluation over encrypted XML databases

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-1-4939-2092-1_33openalex-snapshot
Selective and Private Access to Outsourced Data Centers
inferred← citeshttps://doi.org/10.1007/978-3-319-26187-4_5openalex-snapshot
Privacy-Enhancing Range Query Processing over Encrypted Cloud Databases
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_15openalex-snapshot
Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud
inferred← citeshttps://doi.org/10.1016/j.future.2016.11.028openalex-snapshot
Aggregating privatized medical data for secure querying applications
inferred← citeshttps://doi.org/10.1109/bdcloud.2014.59openalex-snapshot
Protecting Access Confidentiality with Data Distribution and Swapping
inferred← citeshttps://doi.org/10.1109/cloud.2013.123openalex-snapshot
Secure Enterprise Data Deduplication in the Cloud
inferred← citeshttps://doi.org/10.1109/icbda65366.2025.11211452openalex-snapshot
A New Construction Method for B+-Tree Structure with GPGPU
inferred← citeshttps://doi.org/10.1109/tcc.2015.2449993openalex-snapshot
Three-Server Swapping for Access Confidentiality
inferred← citeshttps://doi.org/10.1145/2747878openalex-snapshot
Shuffle Index
inferred← citeshttps://doi.org/10.1145/2906153openalex-snapshot
Ensuring Security and Privacy Preservation for Cloud Data Services
inferred← citeshttps://doi.org/10.1186/s13677-014-0025-1openalex-snapshot
Confidential database-as-a-service approaches: taxonomy and survey
inferred← citeshttps://doi.org/10.32920/ryerson.14654145.v1openalex-snapshot
Secure Data Deduplication in Cloud Environments
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.