Space-Efficient Private Search with Applications to Rateless Codes

  • George Danezis
  • Claudia Diaz
Conference paper

DOI: 10.1007/978-3-540-77366-5_15

Volume 4886 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Danezis G., Diaz C. (2007) Space-Efficient Private Search with Applications to Rateless Codes. In: Dietrich S., Dhamija R. (eds) Financial Cryptography and Data Security. FC 2007. Lecture Notes in Computer Science, vol 4886. Springer, Berlin, Heidelberg

Abstract

Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the space efficiency of the Ostrovsky et al. Private Search [9] scheme, by describing methods that require considerably shorter buffers for returning the results of the search. Our basic decoding scheme recursive extraction, requires buffers of length less than twice the number of returned results and is still simple and highly efficient. Our extended decoding schemes rely on solving systems of simultaneous equations, and in special cases can uncover documents in buffers that are close to 95% full. Finally we note the similarity between our decoding techniques and the ones used to decode rateless codes, and show how such codes can be extracted from encrypted documents.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • George Danezis
    • 1
  • Claudia Diaz
    • 1
  1. 1.K.U. LeuvenESAT/COSICLeuven-HeverleeBelgium