How to Make a Secure Index for Searchable Symmetric Encryption, Revisited

Yohei WATANABE; Takeshi NAKAI; Kazuma OHARA; Takuya NOJIMA; Yexuan LIU; Mitsugu IWAMOTO; Kazuo OHTA

doi:10.1587/transfun.2021EAP1163

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited

Yohei WATANABE, Takeshi NAKAI, Kazuma OHARA, Takuya NOJIMA, Yexuan LIU, Mitsugu IWAMOTO, Kazuo OHTA

Full Text Views

0

Cite this

Summary :

Searchable symmetric encryption (SSE) enables clients to search encrypted data. Curtmola et al. (ACM CCS 2006) formalized a model and security notions of SSE and proposed two concrete constructions called SSE-1 and SSE-2. After the seminal work by Curtmola et al., SSE becomes an active area of encrypted search. In this paper, we focus on two unnoticed problems in the seminal paper by Curtmola et al. First, we show that SSE-2 does not appropriately implement Curtmola et al.'s construction idea for dummy addition. We refine SSE-2's (and its variants') dummy-adding procedure to keep the number of dummies sufficiently many but as small as possible. We then show how to extend it to the dynamic setting while keeping the dummy-adding procedure work well and implement our scheme to show its practical efficiency. Second, we point out that the SSE-1 can cause a search error when a searched keyword is not contained in any document file stored at a server and show how to fix it.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E105-A No.12 pp.1559-1577

Publication Date: 2022/12/01

Publicized: 2022/05/25

Online ISSN: 1745-1337

DOI: 10.1587/transfun.2021EAP1163

Type of Manuscript: PAPER

Category: Cryptography and Information Security

Authors

Yohei WATANABE
  the University of Electro-Communications (UEC),National Institute of Information and Communications Technology (NICT)
Takeshi NAKAI
  the University of Electro-Communications (UEC)
Kazuma OHARA
  National Institute of Advanced Industrial Science and Technology (AIST)
Takuya NOJIMA
  the University of Electro-Communications (UEC)
Yexuan LIU
  Yokohama National University (YNU)
Mitsugu IWAMOTO
  the University of Electro-Communications (UEC)
Kazuo OHTA
  the University of Electro-Communications (UEC),National Institute of Advanced Industrial Science and Technology (AIST)

Keyword

searchable symmetric encryption, secure index, encrypted search

Cite this

Copy

Yohei WATANABE, Takeshi NAKAI, Kazuma OHARA, Takuya NOJIMA, Yexuan LIU, Mitsugu IWAMOTO, Kazuo OHTA, "How to Make a Secure Index for Searchable Symmetric Encryption, Revisited" in IEICE TRANSACTIONS on Fundamentals, vol. E105-A, no. 12, pp. 1559-1577, December 2022, doi: 10.1587/transfun.2021EAP1163.
Abstract: Searchable symmetric encryption (SSE) enables clients to search encrypted data. Curtmola et al. (ACM CCS 2006) formalized a model and security notions of SSE and proposed two concrete constructions called SSE-1 and SSE-2. After the seminal work by Curtmola et al., SSE becomes an active area of encrypted search. In this paper, we focus on two unnoticed problems in the seminal paper by Curtmola et al. First, we show that SSE-2 does not appropriately implement Curtmola et al.'s construction idea for dummy addition. We refine SSE-2's (and its variants') dummy-adding procedure to keep the number of dummies sufficiently many but as small as possible. We then show how to extend it to the dynamic setting while keeping the dummy-adding procedure work well and implement our scheme to show its practical efficiency. Second, we point out that the SSE-1 can cause a search error when a searched keyword is not contained in any document file stored at a server and show how to fix it.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021EAP1163/_p

Copy

@ARTICLE{e105-a_12_1559,
author={Yohei WATANABE, Takeshi NAKAI, Kazuma OHARA, Takuya NOJIMA, Yexuan LIU, Mitsugu IWAMOTO, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={How to Make a Secure Index for Searchable Symmetric Encryption, Revisited},
year={2022},
volume={E105-A},
number={12},
pages={1559-1577},
abstract={Searchable symmetric encryption (SSE) enables clients to search encrypted data. Curtmola et al. (ACM CCS 2006) formalized a model and security notions of SSE and proposed two concrete constructions called SSE-1 and SSE-2. After the seminal work by Curtmola et al., SSE becomes an active area of encrypted search. In this paper, we focus on two unnoticed problems in the seminal paper by Curtmola et al. First, we show that SSE-2 does not appropriately implement Curtmola et al.'s construction idea for dummy addition. We refine SSE-2's (and its variants') dummy-adding procedure to keep the number of dummies sufficiently many but as small as possible. We then show how to extend it to the dynamic setting while keeping the dummy-adding procedure work well and implement our scheme to show its practical efficiency. Second, we point out that the SSE-1 can cause a search error when a searched keyword is not contained in any document file stored at a server and show how to fix it.},
keywords={},
doi={10.1587/transfun.2021EAP1163},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - How to Make a Secure Index for Searchable Symmetric Encryption, Revisited
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1559
EP - 1577
AU - Yohei WATANABE
AU - Takeshi NAKAI
AU - Kazuma OHARA
AU - Takuya NOJIMA
AU - Yexuan LIU
AU - Mitsugu IWAMOTO
AU - Kazuo OHTA
PY - 2022
DO - 10.1587/transfun.2021EAP1163
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2022
AB - Searchable symmetric encryption (SSE) enables clients to search encrypted data. Curtmola et al. (ACM CCS 2006) formalized a model and security notions of SSE and proposed two concrete constructions called SSE-1 and SSE-2. After the seminal work by Curtmola et al., SSE becomes an active area of encrypted search. In this paper, we focus on two unnoticed problems in the seminal paper by Curtmola et al. First, we show that SSE-2 does not appropriately implement Curtmola et al.'s construction idea for dummy addition. We refine SSE-2's (and its variants') dummy-adding procedure to keep the number of dummies sufficiently many but as small as possible. We then show how to extend it to the dynamic setting while keeping the dummy-adding procedure work well and implement our scheme to show its practical efficiency. Second, we point out that the SSE-1 can cause a search error when a searched keyword is not contained in any document file stored at a server and show how to fix it.
ER -