Paper 2022/1262
Vectorized Batch Private Information Retrieval
Abstract
This paper studies Batch Private Information Retrieval (BatchPIR), a variant of private information retrieval (PIR) where the client wants to retrieve multiple entries from the server in one batch. BatchPIR matches the use case of many practical applications and holds the potential for substantial efficiency improvements over PIR in terms of amortized cost per query. Existing BatchPIR schemes have achieved decent computation efficiency but have not been able to improve communication efficiency at all. Using vectorized homomorphic encryption, we present the first BatchPIR protocol that is efficient in both computation and communication for a variety of database configurations. Specifically, to retrieve a batch of 256 entries from a database with one million entries of 256 bytes each, the communication cost of our scheme is 7.5x to 98.5x better than state-of-the-art solutions.
Note: We added more experiments and evaluations.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. IEEE Symposium on Security and Privacy 2023
- Keywords
- Private information retrieval Homomorphic encryption
- Contact author(s)
-
mughees2 @ illinois edu
renling @ illinois edu - History
- 2022-12-13: revised
- 2022-09-23: received
- See all versions
- Short URL
- https://ia.cr/2022/1262
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1262,
author = {Muhammad Haris Mughees and Ling Ren},
title = {Vectorized Batch Private Information Retrieval},
howpublished = {Cryptology ePrint Archive, Paper 2022/1262},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/1262}},
url = {https://eprint.iacr.org/2022/1262}
}
