Cryptology ePrint Archive: Report 2007/392

A Fast Protocol for Computationally Private Information Retrieval

Andy Parrish and Jonathan Trostle

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.

Category / Keywords: cryptographic protocols /

Date: received 8 Oct 2007

Contact author: jonathan trostle at jhuapl edu

Available formats: PDF | BibTeX Citation

Version: 20071014:182213 (All versions of this report)

Discussion forum: Show discussion | Start new discussion