CryptoDB
A Fast Protocol for Computationally Private Information Retrieval
Authors: | |
---|---|
Download: | |
Abstract: | We present a new private information retrieval (PIR) protocol. The protocol is based on a single private, non-shared key cryptosystem; the security of this cryptosystem is based on a new hardness (secret base) assumption. We prove security for the secret base assumption in an extended generic group model. We also show parameters that ensure security against a lattice-based attack. We measure performance using the methodology in \cite{sion}; our scheme is orders of magnitude faster than any existing scheme and faster than the trivial protocol for the home user scenario. |
BibTeX
@misc{eprint-2007-13672, title={A Fast Protocol for Computationally Private Information Retrieval}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols /}, url={http://eprint.iacr.org/2007/392}, note={ jonathan.trostle@jhuapl.edu 13794 received 8 Oct 2007}, author={Andy Parrish and Jonathan Trostle}, year=2007 }