(Enter summary)
Abstract: We establish the following, quite unexpected, result:
replication of data for the computational Private
Information Retrieval problem is not necessary.
More specifically, based on the quadratic residuosity
assumption, we present a single database,
computationally-private information-retrieval scheme
with O(n
ffl
) communication complexity for any ffl ? 0.
1 Introduction
1.1 Problem Statement and History
Private Information Retrieval (PIR) schemes allow a
user to retrieve information from a ... (Update)
Cited by: More
Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000)
(Correct)
Single Database Private Information Retrieval with Logarithmic.. - Chang (2004)
(Correct)
Repudiative Information Retrieval - Asonov, Freytag (2002)
(Correct)
Active bibliography (related documents): More All
0.1: Replication Is Not Needed: - Single Database..
(Correct)
0.0: Private Access to Distributed Information - Mann (1998)
(Correct)
0.0: Quantum Computation and Privacy - Wehner (2004)
(Correct)
Similar documents based on text: More All
0.8: Improved Upper Bounds on Information-Theoretic Private.. - Ishai, Kushilevitz (1999)
(Correct)
0.6: Private Information Retrieval for Streaming Data - Anonymous Author October
(Correct)
0.4: Private Information Retrieval - Chor, Goldreich, Kushilevitz, Sudan (1995)
(Correct)
Related documents from co-citation: More All
14: Private information retrieval
- Chor, Goldreich et al. - 1995
11: Computationally private information retrieval with polylogarithmic communication
- Cachin, Micali et al. - 1999
8: Oblivious Transfer and Polynomial Evaluation (context) - Naor, Pinkas - 1998
BibTeX entry: (Update)
E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single data base computationally-private information retrieval. In Proc. 38th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 364-- 373, 1997. http://citeseer.ist.psu.edu/kushilevitz97replication.html More
@inproceedings{ kushilevitz97replication,
author = "Eyal Kushilevitz and Rafail Ostrovsky",
title = "Replication is {NOT} Needed: {SINGLE} Database, Computationally-Private Information Retrieval",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "364-373",
year = "1997",
url = "citeseer.ist.psu.edu/kushilevitz97replication.html" }
Citations (may not include all citations):
197
A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
174
Private Information Retrieval
- Chor, Goldreich et al. - 1995
116
Algorithmic Number Theory (context) - Bach, Shallit - 1996
103
A Simple Unpredictable Pseudo-Random Number Generator (context) - Blum, Blum et al. - 1986
84
Noninteractive Zero- Knowledge
- Blum, De-Santis et al. - 1991
68
Computationally Private Information Retrieval
- Chor, Gilboa - 1997
61
Upper bound on the communication complexity of private infor..
- Ambainis - 1997
41
NonTransitive Transfer of Confidence: A Perfect Zero-Knowled..
- Brassard, Crepeau - 1986
27
Private Information Retrieval by Keywords
- Chor, Gilboa et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.counterpane.com/biblio/year-1997.html): More
How to Convert Any Digital Signature Scheme Into a Group.. - Petersen (1997)
(Correct)
Exact Analysis of Exact Change - Frankel, Patt-Shamir, Tsiounis (1997)
(Correct)
Efficient Cryptographic Protocols based on Noisy Channels - Crepeau (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC