You are looking at a specific version 20060123:210203 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Dagstuhl School Publication
Contact author(s)
gdanezis @ esat kuleuven be
History
2006-01-23: received
Short URL
https://ia.cr/2006/024
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.