An Improved Lindell-Waisbard Private Web Search Scheme

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 queries the search engine with the word. We remark that a malicious party could query the search engine with a fake word instead of the word obtained. The malicious party can link the true word to its provider if the victim 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, from a user's perspective, 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 pick another n-1 padding words to form a group of n words and permute these words randomly. Finally, he queries the search engine with all these words.

[1]  Zhenfu Cao,et al.  A secure anonymous routing protocol with authenticated key exchange for ad hoc networks , 2007, Comput. Stand. Interfaces.

[2]  Masayuki Abe,et al.  Mix-Networks on Permutation Networks , 1999, ASIACRYPT.

[3]  Chun-Ta Li,et al.  A lightweight anonymous routing protocol without public key en/decryptions for wireless ad hoc networks , 2011, Inf. Sci..

[4]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[5]  Yehuda Lindell,et al.  Private Web Search with Malicious Adversaries , 2010, Privacy Enhancing Technologies.

[6]  Vicenç Torra,et al.  DisPA: An Intelligent Agent for Private Web Search , 2015, Advanced Research in Data Privacy.

[7]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[8]  Min-Shiang Hwang,et al.  A False Data Report Filtering Scheme in Wireless Sensor Networks : A Survey , 2015 .

[9]  Yvo Desmedt,et al.  How to Break a Practical MIX and Design a New One , 2000, EUROCRYPT.

[10]  Jens Groth,et al.  A Verifiable Secret Shuffle of Homomorphic Encryptions , 2003, Journal of Cryptology.

[11]  C. Andrew Neff,et al.  A verifiable secret shuffle and its application to e-voting , 2001, CCS '01.

[12]  Tzer-jen Wei.  Communication efficient shuffle for mental poker protocols , 2011, Inf. Sci..

[13]  Somanath Tripathy,et al.  Provably Secure Routing Protocol for Wireless Mesh Networks , 2014, Int. J. Netw. Secur..

[14]  Chun-Ta Li,et al.  A secure routing protocol with node selfishness resistance in MANETs , 2012, Int. J. Mob. Commun..

[15]  Pin-Han Ho,et al.  ASRPAKE: An Anonymous Secure Routing Protocol with Authenticated Key Exchange for Wireless Ad Hoc Networks , 2007, 2007 IEEE International Conference on Communications.

[16]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[17]  Devesh C. Jinwala,et al.  An Efficient Approach for Privacy Preserving Distributed Clustering in Semi-honest Model Using Elliptic Curve Cryptography , 2015 .

[18]  W. Marsden.  I and J , 2012 .

[19]  Feng Wang,et al.  Group Authentication and Group Key Distribution for Ad Hoc Networks , 2015, Int. J. Netw. Secur..

[20]  Alexandre Viejo,et al.  Multi-party Methods for Privacy-Preserving Web Search: Survey and Contributions , 2015, Advanced Research in Data Privacy.

[21]  Jordi Herrera-Joancomartí,et al.  Preserving user's privacy in web search engines , 2009, Comput. Commun..

[22]  Markus Jakobsson,et al.  A Practical Mix , 1998, EUROCRYPT.

[23]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[24]  Min-Shiang Hwang,et al.  Distributed Detecting Node Replication Attacks in Wireless Sensor Networks: A Survey , 2014, Int. J. Netw. Secur..

[25]  Kazue Sako,et al.  An Efficient Scheme for Proving a Shuffle , 2001, CRYPTO.