loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Bolam Kang ; Sung Cheol Goh and Myungsun Kim

Affiliation: The University of Suwon, Korea, Republic of

ISBN: 978-989-758-081-9

Keyword(s): Private web search (PWS), Secret sharing, Public-key encryption, Round efficiency.

Related Ontology Subjects/Areas/Topics: Information and Systems Security ; Privacy Enhancing Technologies

Abstract: Web searches are increasingly becoming essential activites because they are often the most effective and convenient way of finding information. However, a web search can be a threat to the privacy of users because their queries may reveal sensitive information. Private web search (PWS) solutions allow users to find information on the Internet while preserving their privacy. According to their underlying technology, existing PWS solutions can be divided into three types: Proxy-based solutions, Obfuscation-based solutions, and Cryptography-based solutions. Among them, cryptography-based PWS (CB-PWS) systems are particularly interesting because they provide strong privacy guarantees. In this paper, we present a constant-round CB-PWS protocol that preserves computational efficiency compared to known CB-PWS systems. To prove these arguments, we first analyze the efficiency of our protocol. According to our analysis, our protocol simply requires 3n modular exponentiations for n users. In pa rticular, our protocol is a 5-round protocol that requires O(n) communication complexity. In addition, evaluating the security of our protocol shows that our construction is comparable to similar solutions in terms of user privacy. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.209.80.87

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kang, B.; Goh, S. and Kim, M. (2015). Private Web Search with Constant Round Efficiency.In Proceedings of the 1st International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-081-9, pages 205-212. DOI: 10.5220/0005225602050212

@conference{icissp15,
author={Bolam Kang. and Sung Cheol Goh. and Myungsun Kim.},
title={Private Web Search with Constant Round Efficiency},
booktitle={Proceedings of the 1st International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2015},
pages={205-212},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005225602050212},
isbn={978-989-758-081-9},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Private Web Search with Constant Round Efficiency
SN - 978-989-758-081-9
AU - Kang, B.
AU - Goh, S.
AU - Kim, M.
PY - 2015
SP - 205
EP - 212
DO - 10.5220/0005225602050212

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.