Presentation 2017-05-12
Fully Secure Oblivious Keyword Search
Kaoru Kurosawa, Yuuki Nemoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Oblivious keyword search (OKS) is a secure two party protocol such that the server has ( Data={(x_i,m_i)} ), and the client receives ( Search(w)={m_i mid w=x_i} ) for a search word $w$, where $x_i$ is a keyword and $m_i$ is the associated payload (database record). In the previous protocols, only the privacy of each party is proved. In this paper, we show the first fully secure OKS protocol under the DDH assumption in the CRS model. Not only the privacy of each party is proved, but also it is proved that the client outputs $Search(w)$ correctly even if the server is malicious.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) keyword search / DDH / CRS model
Paper # ISEC2017-2
Date of Issue 2017-05-05 (ISEC)

Conference Information
Committee ISEC
Conference Date 2017/5/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Kikai-Shinko-Kaikan Bldg.
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Masahiro Mambo(Kanazawa Univ.)
Vice Chair Kazuto Ogawa(NHK) / Atsushi Fujioka(Kanagawa Univ.)
Secretary Kazuto Ogawa(Toshiba) / Atsushi Fujioka(Tohoku Univ.)
Assistant Toshihiro Ohigashi(Tokai Univ.) / Yuuji Suga(IIJ) / Atsuo Inomata(Tokyo Denki Univ.)

Paper Information
Registration To Technical Committee on Information Security
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fully Secure Oblivious Keyword Search
Sub Title (in English)
Keyword(1) keyword search
Keyword(2) DDH
Keyword(3) CRS model
1st Author's Name Kaoru Kurosawa
1st Author's Affiliation Ibaraki University(Ibaraki Univ.)
2nd Author's Name Yuuki Nemoto
2nd Author's Affiliation Ibaraki University(Ibaraki Univ.)
Date 2017-05-12
Paper # ISEC2017-2
Volume (vol) vol.117
Number (no) ISEC-25
Page pp.pp.7-14(ISEC),
#Pages 8
Date of Issue 2017-05-05 (ISEC)