Differentially private range query on shortest paths

DOI10.1007/978-3-031-38906-1_23arXiv2212.07997OpenAlexW4385364464MaRDI QIDQ6179425

No author found.

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.07997

zbMATH Keywords

shortest pathdifferential privacyrange query

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• On the geometry of differential privacy
• Iterative Constructions and Private Data Release
• VC-Dimension and Shortest Path Algorithms
• The Algorithmic Foundations of Differential Privacy
• Private and Continual Release of Statistics
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Fingerprinting Codes and the Price of Approximate Differential Privacy
• High-Dimensional Statistics
• A learning theory approach to noninteractive database privacy
• Unconditional differentially private mechanisms for linear queries
• Optimal private halfspace counting via discrepancy
• Theory of Cryptography
• Geometric discrepancy. An illustrated guide

This page was built for publication: Differentially private range query on shortest paths