Paper 1996/006 Original: eprint.iacr.org/1996/006 ↗
Upper bound on the communication complexity of private information retrieval
Abstract
Private information retrieval was introduced by Chor, Goldreich, Kushilevitz and Sudan. It is the problem of reading a bit from the database so that it remains secret which bit we need. If the database exists in several identical copies, it is possible to ask queries so that each of copies alone does not get any information about the adress of the needed bit. We construct a scheme for private information retrieval with k databases and O(n sup (1/(2k-1)) ) bits of communication.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 1996-05-23: last updated
- 1996-05-23: published
- Short URL
- https://ia.cr/1996/006
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:1996/006,
author = {Andris Ambainis},
title = {Upper bound on the communication complexity of private information retrieval},
howpublished = {Cryptology {ePrint} Archive, Paper 1996/006},
year = {1996},
url = {https://eprint.iacr.org/1996/006}
}