Cryptology ePrint Archive: Report 2006/024

Improving the Decoding Efficiency of Private Search

George Danezis and Claudia Diaz

Abstract: Abstract. We show two ways of recovering all matching documents, in the Ostrovsky et al. Private Search [3], while requiring considerably shorter buffers. Both schemes rely on the fact that documents colliding in a buffer position provide the sum of their plaintexts. Efficient decoding algorithms can make use of this property to recover documents never present alone in a buffer position.

Category / Keywords: cryptographic protocols /

Publication Info: Dagstuhl School Publication

Date: received 20 Jan 2006

Contact author: gdanezis at esat kuleuven be

Available format(s): PDF | BibTeX Citation

Version: 20060123:210203 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]