### Private Information Storage

Rafail Ostrovsky and Victor Shoup

##### Abstract

We consider the setting of hiding information through the use of multiple databases that do not interact with one another. Previously, in this setting solutions for retrieval of data in the efficient manner were given, where a user achieves this by interacting with all the databases. We consider the case of both writing and reading. While the case of reading was well studied before, the case of writing was previously completely open. In this paper, we show how to implement both read and write operations. As in the previous papers, we measure, as a function of k and n the amount of communication required between a user and all the databases for a single read/write operation, and achieve efficient read/write schemes. Moreover, we show a general reduction from reading database scheme to reading and writing database scheme, with the following guarantees: for any k, given a retrieval only k-database scheme with communication complexity R(k,n) we show a (k+1) reading and writing database scheme with total communication complexity O(R(k,n) * (log n)^{O(1)}). It should be stressed that prior to the current paper no trivial (i.e. sub-linear) bounds for private information storage were known.

Available format(s)
Publication info
Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Keywords
(none supplied)
Contact author(s)
rafail @ bellcore com
History
Short URL
https://ia.cr/1996/005

CC BY

BibTeX

@misc{cryptoeprint:1996/005,
author = {Rafail Ostrovsky and Victor Shoup},
title = {Private Information Storage},
howpublished = {Cryptology ePrint Archive, Paper 1996/005},
year = {1996},
note = {\url{https://eprint.iacr.org/1996/005}},
url = {https://eprint.iacr.org/1996/005}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.