Privacy-preserving web search

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.