DagSemProc.05411.3.pdf
- Filesize: 130 kB
- 11 pages
Document
Improving the Decoding Efficiency of Private Search
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5411
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-11-02
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)
https://doi.org/10.4230/DagSemProc.05411.3
https://doi.org/10.4230/DagSemProc.05411.3
Abstract
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.
Keywords
- Private search
- private information retrieval
- cryptography
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads