License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05411.3
URN: urn:nbn:de:0030-drops-4829
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/482/
Go to the corresponding Portal

Danezis, George ; Diaz, Claudia

Improving the Decoding Efficiency of Private Search

pdf-format:
05411.DanezisGeorge.Paper.482.pdf (0.1 MB)

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:DagSemProc.05411.3,
  author =	{Danezis, George and Diaz, Claudia},
  title =	{{Improving the Decoding Efficiency of Private Search}},
  booktitle =	{Anonymous Communication and its Applications},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5411},
  editor =	{Shlomi Dolev and Rafail Ostrovsky and Andreas Pfitzmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/482},
  URN =		{urn:nbn:de:0030-drops-4829},
  doi =		{10.4230/DagSemProc.05411.3},
  annote =	{Keywords: Private search, private information retrieval, cryptography}
}

Keywords: Private search, private information retrieval, cryptography
Collection: 05411 - Anonymous Communication and its Applications
Issue Date: 2006
Date of publication: 02.11.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI