Paper 2014/604
Private Web Search with Constant Round Efficiency
Bolam Kang, Sung Cheol Goh, and Myungsun Kim
Abstract
Web search is increasingly becoming an essential activity as it is frequently the most effective and convenient way of finding information. However, it can be a threat for the privacy of users because their queries may reveal their sensitive information. Private web search (PWS) solutions allow users to find information in the Internet while preserving their privacy. In particular, cryptography-based PWS (CB-PWS) systems provide strong privacy guarantees. This paper introduces a constant-round CB-PWS protocol which remains computationally efficient, compared to known CB-PWS systems. Our construction is comparable to similar solutions regarding users' privacy.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Minor revision. ICISSP 2015
- Keywords
- Private web search (PWS)Secret sharingPublic-key encryption
- Contact author(s)
- msunkim @ suwon ac kr
- History
- 2015-02-02: revised
- 2014-08-13: received
- See all versions
- Short URL
- https://ia.cr/2014/604
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/604, author = {Bolam Kang and Sung Cheol Goh and Myungsun Kim}, title = {Private Web Search with Constant Round Efficiency}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/604}, year = {2014}, url = {https://eprint.iacr.org/2014/604} }