On the public citation graph

Privacy-Preserving Protocols for Shortest Path Discovery over Outsourced Encrypted Graph Data

0 signed · 35 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-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-3-319-11203-9_23openalex-snapshot
Privacy-Preserving Complex Query Evaluation over Semantically Secure Encrypted Data
inferredcites →https://doi.org/10.1007/978-3-540-71677-8_26openalex-snapshot
A Survey of Single-Database Private Information Retrieval: Techniques and Applications
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/icde.2014.6816688openalex-snapshot
Practical k nearest neighbor queries with location privacy
inferredcites →https://doi.org/10.1109/icde.2014.6816690openalex-snapshot
Secure k-nearest neighbor query over encrypted data in outsourced environments
inferredcites →https://doi.org/10.1109/iri.2015.72openalex-snapshot
Privacy-Preserving Protocols for Shortest Path Discovery over Outsourced Encrypted Graph Data
inferredcites →https://doi.org/10.1109/tkde.2013.87openalex-snapshot
Privacy-Preserving and Content-Protecting Location Based Queries
inferredcites →https://doi.org/10.1145/1376616.1376631openalex-snapshot
Private queries in location based services
inferredcites →https://doi.org/10.1145/1645953.1646041openalex-snapshot
Navigational path privacy protection
inferredcites →https://doi.org/10.1145/2382616.2382620openalex-snapshot
Beyond Social Graphs
inferredcites →https://doi.org/10.1145/2484313.2484341openalex-snapshot
Data-oblivious graph algorithms for secure computation and outsourcing
inferredcites →https://doi.org/10.1145/2487575.2487665openalex-snapshot
Efficient single-source shortest path and distance queries on large graphs
inferredcites →https://doi.org/10.1145/2631775.2631799openalex-snapshot
The shortest path to happiness
inferredcites →https://doi.org/10.1145/293347.293350openalex-snapshot
Private information retrieval
inferredcites →https://doi.org/10.14778/1920841.1920920openalex-snapshot
Nearest neighbor search with strong location privacy
inferredcites →https://doi.org/10.14778/1921071.1921074openalex-snapshot
Graph indexing of road networks for shortest path queries with label restrictions
inferredcites →https://doi.org/10.14778/2140436.2140438openalex-snapshot
Shortest path and distance queries on road networks
inferredcites →https://doi.org/10.14778/2212351.2212352openalex-snapshot
Shortest path computation with no information leakage

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s11280-018-0550-9openalex-snapshot
Protecting multi-party privacy in location-aware social point-of-interest recommendation
inferred← citeshttps://doi.org/10.1007/s11390-017-1772-5openalex-snapshot
Privacy-Preserving Task Assignment in Spatial Crowdsourcing
inferred← citeshttps://doi.org/10.1007/s13177-020-00234-1openalex-snapshot
A Collaborative 1-to-n On-Demand Ride Sharing Scheme Using Locations of Interest for Recommending Shortest Routes and Pick-up Points
inferred← citeshttps://doi.org/10.1109/access.2017.2765317openalex-snapshot
A Privacy-Preserving Framework for Trust-Oriented Point-of-Interest Recommendation
inferred← citeshttps://doi.org/10.1109/comsnets51098.2021.9352809openalex-snapshot
Securely Computing Clustering Coefficient for Outsourced Dynamic Encrypted Graph Data
inferred← citeshttps://doi.org/10.1109/icde.2016.7498254openalex-snapshot
Practical private shortest path computation based on Oblivious Storage
inferred← citeshttps://doi.org/10.1109/jiot.2020.3007518openalex-snapshot
PPO-CPQ: A Privacy-Preserving Optimization of Clinical Pathway Query for E-Healthcare Systems
inferred← citeshttps://doi.org/10.1109/tifs.2018.2885282openalex-snapshot
pRide: Privacy-Preserving Ride Matching Over Road Networks for Online Ride-Hailing Service
inferred← citeshttps://doi.org/10.1109/tifs.2021.3065832openalex-snapshot
A Privacy-Preserving Online Ride-Hailing System Without Involving a Third Trusted Server
inferred← citeshttps://doi.org/10.1109/tnsm.2023.3317420openalex-snapshot
Graph-Based Data Publication via Differentially Structural Inference
inferred← citeshttps://doi.org/10.3390/cryptography4040029openalex-snapshot
ESPADE: An Efficient and Semantically Secure Shortest Path Discovery for Outsourced Location-Based Services
inferred← citeshttps://doi.org/10.5441/002/edbt.2017.49openalex-snapshot
Protecting Location Privacy in Spatial Crowdsourcing using Encrypted Data
showing the first 12 of 13 · page through all 13
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.