Improving the Decoding Efficiency of Private Search

Authors George Danezis, Claudia Diaz

Thumbnail PDF


  • Filesize: 130 kB
  • 11 pages

Document Identifiers

Author Details

George Danezis
Claudia Diaz

Cite AsGet BibTex

George Danezis and Claudia Diaz. Improving the Decoding Efficiency of Private Search. In Anonymous Communication and its Applications. Dagstuhl Seminar Proceedings, Volume 5411, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


We show two ways of recovering all matching documents, in the Ostrovsky et al. Private Search, 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.
  • Private search
  • private information retrieval
  • cryptography


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail