Title :
Privacy-preserving web search
Author :
Kim, Myungsun ; Kim, Jihye
Author_Institution :
Dept. of Math. Sci., Seoul Nat. Univ., Seoul, South Korea
Abstract :
Since there are many sources of potentially identifying information in web search (e.g. IP address), we need to ways to hide major clues to the user´s identity. Although there have been prior attempts to address this problem, all of them incur linear round complexity in the number of users. In this paper, we construct a constant-round private web search protocol using decomposable encryption, secure in the honest-but-curious model.
Keywords :
Internet; computational complexity; cryptographic protocols; data privacy; information retrieval; constant-round private Web search protocol; decomposable encryption; honest-but-curious model; information identification; linear round complexity; privacy-preserving Web search; user identity; Encryption; Engines; Polynomials; Privacy; Protocols; Web search; decomposable encryption; privacy; shuffle; web search;
Conference_Titel :
Ubiquitous and Future Networks (ICUFN), 2012 Fourth International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-1-4673-1377-3
Electronic_ISBN :
2165-8528
DOI :
10.1109/ICUFN.2012.6261755
