Improving the Decoding Efficiency of Private Search

George Danezis; Claudia Diaz

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: CC BY

BibTeX

@misc{cryptoeprint:2006/024,
      author = {George Danezis and Claudia Diaz},
      title = {Improving the Decoding Efficiency of Private Search},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/024},
      year = {2006},
      url = {https://eprint.iacr.org/2006/024}
}