Towards Doubly Efficient Private Information Retrieval-Reference-Cited by-同舟云学术

Towards Doubly Efficient Private Information Retrieval

Published:2017 Issue: Volume: Page:694-726
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Canetti Ran,Holmgren Justin,Richelson Silas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70503-3_23

Reference21 articles.

1. Ajtai, M.: Oblivious rams without cryptographic assumptions. In: STOC, pp. 181–190. ACM (2010)

2. Lecture Notes in Computer Science;A Beimel,2001

3. Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers’ computation in private information retrieval: PIR with preprocessing. J. Cryptol. 17(2), 125–151 (2004)

4. Boyle, E., Ishai, Y., Pass, R., Wootters, M.: Can we access a database both locally and privately? Cryptology ePrint Archive, Report 2017/567 (2017). http://eprint.iacr.org/2017/567

5. Lecture Notes in Computer Science;D Bleichenbacher,2000

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

1. Single-Server PIR via NTRU-Based FHE: Simpler, Smaller, and Faster;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08

2. LightPIR: Single-Server PIR via FHE without Gaussian Noise;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

3. Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

4. Survey and open problems in privacy-preserving knowledge graph: merging, query, representation, completion, and applications;International Journal of Machine Learning and Cybernetics;2024-03-02

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