Paper 2002/182 Original: eprint.iacr.org/2002/182 ↗
Oblivious Keyword Search
Abstract
In this paper, we introduce a notion of Oblivious Keyword Search ($OKS$). Let $W$ be the set of possible keywords. In the commit phase, a database supplier $T$ commits $n$ data. In each transfer subphase, a user $U$ can choose a keyword $w \in W$ adaptively and find $Search(w)$ without revealing $w$ to $T$, where $Search(w)$ is the set of all data which includes $w$ as a keyword. We then show two efficient protocols such that the size of the commitments is only $(nB)$ regardless of the size of $W$, where $B$ is the size of each data. It is formally proved that $U$ learns nothing more and $T$ gains no information on the keywords which $U$ searched. We further present a more efficient adaptive $OT_k^n$ protocol than the previous one as an application of our first $OKS$ protocol.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2004-03-09: last updated
- 2002-12-01: published
- Short URL
- https://ia.cr/2002/182
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/182,
author = {Wakaha Ogata and Kaoru Kurosawa},
title = {Oblivious Keyword Search},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/182},
year = {2002},
url = {https://eprint.iacr.org/2002/182}
}