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.
- George Danezis (1)