EPDQ: Efficient and Privacy-Preserving Exact Distance Query on Encrypted Graphs
EPDQ: Efficient and Privacy-Preserving Exact Distance Query on Encrypted Graphs explores Enables efficient and private shortest distance queries on encrypted graph databases using a novel tensor-based indexing scheme.. Commercial viability score: 7/10 in Privacy-Preserving Graph Databases.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Builds On ThisSoK: Practical Aspects of Releasing Differentially Private GraphsViability: 4.0
- Builds On ThisLightweight, Practical Encrypted Face Recognition with GPU SupportViability: 4.0
- Builds On ThisPrivacy-Enhancing Encryption in Data Sharing: A Survey on Security, Performance and FunctionalityViability: 3.0
- Builds On ThisDenoising distances beyond the volumetric barrierViability: 2.0
- Builds On ThisDP-S4S: Accurate and Scalable Select-Join-Aggregate Query Processing with User-Level Differential Privacy