Multi-Query Verifiable PIR and Its Application
Private information retrieval (PIR) allows a client to obtain records from a database without revealing the retrieved index to the server. In the single-server model, it has been known that (plain) PIR is vulnerable to selective failure attacks, where a (malicious) server intends to learn information of an index by getting a client's decoded result. Recently, as one solution for this problem, Ben-David et al. (TCC 2022) proposed verifiable PIR (vPIR) that allows a client to verify that the queried database satisfies certain properties. However, the existing vPIR scheme is not practically efficient, especially when we consider the multi-query setting, where a client makes multiple queries for a server to retrieve some records either in parallel or in sequence.
Authors
- Keisuke Hara (ORCID: https://orcid.org/0000-0003-3598-0988)
- Goichiro Hanaoka (ORCID: https://orcid.org/0000-0001-6617-2962)
- Junichiro Hayata
- Kenta Nomura (ORCID: https://orcid.org/0000-0002-4789-0528)
- Masaki Kamizono (ORCID: https://orcid.org/0009-0007-9467-2412)
- Ryuya Hayashi
Institutions
- Deloitte (United Kingdom) (GB)
- National Institute of Advanced Industrial Science and Technology (JP)
- The University of Tokyo (JP)
Publication Details
- Journal
- IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
- Published
- 2025-05-25
- DOI
- https://doi.org/10.1587/transfun.2024dmp0006
- Primary Topic
- Advanced Computational Techniques and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Japan Society for the Promotion of Science
- Core Research for Evolutional Science and Technology