CryptoDB
Improving the Decoding Efficiency of Private Search
Authors: | |
---|---|
Download: | |
Abstract: | Abstract. We show two ways of recovering all matching documents, in the Ostrovsky et al. Private Search [3], 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
@misc{eprint-2006-21517, title={Improving the Decoding Efficiency of Private Search}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols /}, url={http://eprint.iacr.org/2006/024}, note={Dagstuhl School Publication gdanezis@esat.kuleuven.be 13168 received 20 Jan 2006}, author={George Danezis and Claudia Diaz}, year=2006 }