Paper 2007/446 Original: eprint.iacr.org/2007/446 ↗
A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol
Abstract
A PIR scheme is a scheme that allows an user to get an element of a database without giving any information about what part of the database he is interested in. In this paper we present a lattice-based PIR scheme, using an NTRU-like approach, in which the computational cost is a few thousand bit-operations per bit in the database. This improves the protocol computational performance by two orders of magnitude when compared to existing approaches. Our scheme has worse communication performance than other existing protocols, but we show that practical usability of PIR schemes is not as dependent on communication performance as the literature suggests, and that a trade-off between communication and computation leads to much more versatile schemes.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2008-02-24: last updated
- 2007-12-05: published
- Short URL
- https://ia.cr/2007/446
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/446,
author = {Carlos AGUILAR MELCHOR and Philippe GABORIT},
title = {A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/446},
year = {2007},
url = {https://eprint.iacr.org/2007/446}
}