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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Query Verifiable PIR and Its Application

Keisuke Hara, Goichiro Hanaoka, Junichiro Hayata, Kenta Nomura et al.
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Advanced Computational Techniques and Applications
article

Multi-Query Verifiable PIR and Its Application

Keisuke Hara, Goichiro Hanaoka, Junichiro Hayata, Kenta Nomura, Masaki Kamizono, Ryuya Hayashi
article en

Abstract

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.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E108.A(9)
Deloitte (United Kingdom) (GB), National Institute of Advanced Industrial Science and Technology (JP), The University of Tokyo (JP)
Japan Society for the Promotion of Science, Core Research for Evolutional Science and Technology
Openalex Percentile: Top 95%
Advanced Computational Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Multi-Query Verifiable PIR and Its Application — Keisuke Hara, Goichiro Hanaoka, et al. · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences (2025) | TGRS Research Map | TGRS