Danezis, George ;
Diaz, Claudia
Improving the Decoding Efficiency of Private Search
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.
BibTeX - Entry
@InProceedings{danezis_et_al:DSP:2006:482,
author = {George Danezis and Claudia Diaz},
title = {Improving the Decoding Efficiency of Private Search},
booktitle = {Anonymous Communication and its Applications},
year = {2006},
editor = {Shlomi Dolev and Rafail Ostrovsky and Andreas Pfitzmann},
number = {05411},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2006/482},
annote = {Keywords: Private search, private information retrieval, cryptography}
}
|
Keywords: |
|
Private search, private information retrieval, cryptography |
|
Seminar: |
|
05411 - Anonymous Communication and its Applications
|
|
Issue date: |
|
2006 |
|
Date of publication: |
|
02.11.2006 |
02.11.2006
