Welcome to the resource topic for 2002/182
Title:
Oblivious Keyword Search
Authors: Wakaha Ogata, Kaoru Kurosawa
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.
ePrint: https://eprint.iacr.org/2002/182
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .