Replication is not needed: single database, computationally-private information retrieval

@article{Kushilevitz1997ReplicationIN,
  title={Replication is not needed: single database, computationally-private information retrieval},
  author={Eyal Kushilevitz and Rafail Ostrovsky},
  journal={Proceedings 38th Annual Symposium on Foundations of Computer Science},
  year={1997},
  pages={364-373}
}
  • E. Kushilevitz, R. Ostrovsky
  • Published 19 October 1997
  • Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
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/sup /spl epsiv//) communication complexity for any /spl epsiv/>0. 
A report on : Private Information Retrieval
TLDR
In this report, efficient information-theoretically secure methods of information retrieval are studied, ranging from traditional schemes using multiple replicated non-colluding servers, to schemes which use side information to reduce the communication complexity even in the single server case.
A new multi-server scheme for private information retrieval
TLDR
A new scheme which takes both the time and communication complexities into consideration is introduced, which has a simple implementation and is especially suitable if there is only a small number of replicated servers available.
Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a specific data item from a database, replicated among one or more servers, while hiding from each server the identity of the retrieved
A t-private k-database information retrieval scheme
TLDR
This paper presents a private information retrieval scheme for k replicated databases that is information-theoretic secure for coalitions of databases of size t≤k-1 and improves the communication complexity of the scheme described in Ishai and Kushilevitz 1999.
A t-Private k-Database Private Information Retrieval Scheme
A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k repli-cated
Sublinear Scaling for Multi-Client Private Information Retrieval
TLDR
Using batch codes to allow a single client (or collaborating clients) to retrieve multiple records simultaneously while allowing the server computation to scale sublinearly with the number of records fetched.
Computationally Private Information Retrieval with Polylogarithmic Communication
TLDR
A single-database computationally private information retrieval scheme with polylogarithmic communication complexity based on a new, but reasonable intractability assumption, which is essentially the difficulty of deciding whether a small prime divides φ(m), where m is a composite integer of unknown factorization.
On Symmetrically Private Information Retrieval
  • S. Mishra
  • Computer Science
    IACR Cryptol. ePrint Arch.
  • 2000
In this paper we present a single-round, single-server symmetrically private information retrieval scheme, in which privacy of user follows from intractability of the quadratic residuacity problem
Private information retrieval for coded storage
TLDR
It is proved that the tradeoff between storage cost and retrieval/download cost depends on the number of data records in the system, and proposes a class of linear storage codes and retrieval schemes, and derives conditions under which these schemes are error-free and private.
Information sharing across private databases
TLDR
This work formalizes the notion of minimal information sharing across private databases, and develops protocols for intersection, equijoin, intersection size, and Equijoin size.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Private information retrieval
TLDR
Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described.
Computationally private information retrieval (extended abstract)
TLDR
Improved efficiency is achieved by a combination of a novel balancing technique, together with careful application of pseudo random generators, and it is shown that the computational approach leads to substantial savings.
Private Information Retrieval by Keywords
TLDR
A simple, modular way to privately access data by keywords that combines any conventional search structure with any underlying PIR scheme (including single server schemes) and requires no modiication in the way that the search structure is maintained.
Upper Bound on Communication Complexity of Private Information Retrieval
TLDR
This work constructs a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1) ), where n is the number of databases and O is the communication complexity.
Private Information Storage
TLDR
The result yields a solution to the problem of information-theoretically secure Oblivious RAM simulation with poly-log overhead in the above setting and implies that eecient instance-hiding schemes where the state can be altered are possible.
Protecting data privacy in private information retrieval schemes
TLDR
This paper shows how to transform PIR schemes into SPIR schemes (with information-theoretic privacy), paying a constant factor in communication complexity, and introduces a new cryptographic primitive, called conditional disclosure of secrets, which it is believed may be a useful building block for the design of other cryptographic protocols.
A randomized protocol for signing contracts
TLDR
Randomized protocols for signing contracts, certified mail, and flipping a coin are presented and an implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.
Noninteractive Zero-Knowledge
This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string.Without any assumption, it i...
The Knowledge Complexity of Interactive Proof Systems
TLDR
A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.
Software protection and simulation on oblivious RAMs
TLDR
This paper shows how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time, and shows that a logarithmic slowdown is a lower bound.
...
1
2
3
4
5
...