Affiliation:
1. University College London
2. University of Waterloo
Abstract
Abstract
Private Information Retrieval (PIR), despite being well studied, is computationally costly and arduous to scale. We explore lower-cost relaxations of information-theoretic PIR, based on dummy queries, sparse vectors, and compositions with an anonymity system. We prove the security of each scheme using a flexible differentially private definition for private queries that can capture notions of imperfect privacy. We show that basic schemes are weak, but some of them can be made arbitrarily safe by composing them with large anonymity systems.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cybersecurity in Onion Routing Environments: Strategies to Thwart Cyber Threats;Journal of High-Frequency Communication Technologies;2024-07-26
2. Periscoping: Private Key Distribution for Large-Scale Mixnets;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20
3. Bayes Security: A Not So Average Metric;2023 IEEE 36th Computer Security Foundations Symposium (CSF);2023-07
4. Optimal Single-Server Private Information Retrieval;Advances in Cryptology – EUROCRYPT 2023;2023
5. Selective MPC;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07