Private information storage

Rafail Ostrovsky, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper deals with the problem of efficiently and privately storing and retrieving information that is distributively maintained in several databases that do not communicate with one another. The goal is to minimize the communication complexity while maintaining privacy (i.e., so that individual databases do not get any information about the data or the nature of the users' queries). The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan (FOCS '95), but the question whether it is possible to perform both reading and writing in a communication-efficient manner remained open. In this paper, we answer this question in the affirmative, and show that efficient read/write schemes are indeed possible. In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor (in the size of the database), thus establishing that read/write schemes could be implemented as efficiently (up to poly-log factors) as read-only schemes. Additionally, we consider the question of both reading and writing in the computational security setting.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Editors Anon
PublisherACM
Pages294-303
Number of pages10
StatePublished - 1997
EventProceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA
Duration: May 4 1997May 6 1997

Other

OtherProceedings of the 1997 29th Annual ACM Symposium on Theory of Computing
CityEl Paso, TX, USA
Period5/4/975/6/97

Fingerprint

Data storage equipment
Communication

ASJC Scopus subject areas

  • Software

Cite this

Ostrovsky, R., & Shoup, V. (1997). Private information storage. In Anon (Ed.), Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 294-303). ACM.

Private information storage. / Ostrovsky, Rafail; Shoup, Victor.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ed. / Anon. ACM, 1997. p. 294-303.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ostrovsky, R & Shoup, V 1997, Private information storage. in Anon (ed.), Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM, pp. 294-303, Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA, 5/4/97.
Ostrovsky R, Shoup V. Private information storage. In Anon, editor, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM. 1997. p. 294-303
Ostrovsky, Rafail ; Shoup, Victor. / Private information storage. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. editor / Anon. ACM, 1997. pp. 294-303
@inproceedings{69d0da976f2144ce9cc2263c5dcc09de,
title = "Private information storage",
abstract = "This paper deals with the problem of efficiently and privately storing and retrieving information that is distributively maintained in several databases that do not communicate with one another. The goal is to minimize the communication complexity while maintaining privacy (i.e., so that individual databases do not get any information about the data or the nature of the users' queries). The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan (FOCS '95), but the question whether it is possible to perform both reading and writing in a communication-efficient manner remained open. In this paper, we answer this question in the affirmative, and show that efficient read/write schemes are indeed possible. In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor (in the size of the database), thus establishing that read/write schemes could be implemented as efficiently (up to poly-log factors) as read-only schemes. Additionally, we consider the question of both reading and writing in the computational security setting.",
author = "Rafail Ostrovsky and Victor Shoup",
year = "1997",
language = "English (US)",
pages = "294--303",
editor = "Anon",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "ACM",

}

TY - GEN

T1 - Private information storage

AU - Ostrovsky, Rafail

AU - Shoup, Victor

PY - 1997

Y1 - 1997

N2 - This paper deals with the problem of efficiently and privately storing and retrieving information that is distributively maintained in several databases that do not communicate with one another. The goal is to minimize the communication complexity while maintaining privacy (i.e., so that individual databases do not get any information about the data or the nature of the users' queries). The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan (FOCS '95), but the question whether it is possible to perform both reading and writing in a communication-efficient manner remained open. In this paper, we answer this question in the affirmative, and show that efficient read/write schemes are indeed possible. In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor (in the size of the database), thus establishing that read/write schemes could be implemented as efficiently (up to poly-log factors) as read-only schemes. Additionally, we consider the question of both reading and writing in the computational security setting.

AB - This paper deals with the problem of efficiently and privately storing and retrieving information that is distributively maintained in several databases that do not communicate with one another. The goal is to minimize the communication complexity while maintaining privacy (i.e., so that individual databases do not get any information about the data or the nature of the users' queries). The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan (FOCS '95), but the question whether it is possible to perform both reading and writing in a communication-efficient manner remained open. In this paper, we answer this question in the affirmative, and show that efficient read/write schemes are indeed possible. In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor (in the size of the database), thus establishing that read/write schemes could be implemented as efficiently (up to poly-log factors) as read-only schemes. Additionally, we consider the question of both reading and writing in the computational security setting.

UR - http://www.scopus.com/inward/record.url?scp=0030714231&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030714231&partnerID=8YFLogxK

M3 - Conference contribution

SP - 294

EP - 303

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

A2 - Anon, null

PB - ACM

ER -