Paper 2015/299

A Note on the Lindell-Waisbard Private Web Search Scheme

Zhengjun Cao and Lihua Liu

Abstract

In 2010, Lindell and Waisbard proposed a private web search scheme for malicious adversaries. At the end of the scheme, each party obtains one search word and query the search engine with the word. We remark that a malicious party could query the search engine with a false word instead of the word obtained. The malicious party can link the true word to its provider if the party publicly complain for the false searching result. To fix this drawback, each party has to broadcast all shares so as to enable every party to recover all search words and query the search engine with all these words. We also remark that there is a very simple method to achieve the same purpose of private shuffle. When a user wants to privately query the search engine with a word, he can choose another n-1 padding words to form a group of $n$ words and permute these words randomly. Finally, he queries the search engine with these words.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
Private web searchprivate shuffleElGamal encryption
Contact author(s)
liulh @ shmtu edu cn
History
2015-04-01: received
Short URL
https://ia.cr/2015/299
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/299,
      author = {Zhengjun Cao and Lihua Liu},
      title = {A Note on the Lindell-Waisbard  Private Web Search Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2015/299},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/299}},
      url = {https://eprint.iacr.org/2015/299}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.