Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / Private web search; private shuffle; ElGamal encryption

Date: received 31 Mar 2015

Contact author: liulh at shmtu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20150401:144213 (All versions of this report)

Short URL: ia.cr/2015/299

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]