Lower Bounds for (Batch) PIR with Private Preprocessing-Reference-Cited by-同舟云学术

Lower Bounds for (Batch) PIR with Private Preprocessing

Published:2023 Issue: Volume: Page:518-550
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2023
language:
Short-container-title:

Author:

Yeo Kevin

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-30545-0_18

Reference71 articles.

1. Lecture Notes in Computer Science;H Abusalah,2017

2. Aguilar-Melchor, C., Barrier, J., Fousse, L., Killijian, M.-O.: XPIR: private information retrieval for everyone. In: PoPETS (2016)

3. Ali, A., Lepoint, T., Patel, S., Raykova, M., Schoppmann, P., Seth, K., Yeo, K.: Communication-computation trade-offs in PIR. In: USENIX Security (2021)

4. Lecture Notes in Computer Science;A Ambainis,1997

5. Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: IEEE Symposium on Security and Privacy (2018)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case;ACM Transactions on Computation Theory;2024-08-27

2. A Secure Face Verification Scheme Based on Fully Homomorphic Encryption with Anonymity;Information;2024-02-24

3. Parallel private information retrieval protocol with index anonymity for untrusted databases;Journal of King Saud University - Computer and Information Sciences;2024-02

4. Scaling Mobile Private Contact Discovery to Billions of Users;Lecture Notes in Computer Science;2024

5. Lower-Bounds on Public-Key Operations in PIR;Lecture Notes in Computer Science;2024