Pattern Matching over Encrypted Data with a Short Ciphertext

Jongkil Kim; Willy Susilo; Yang Wai Chow; Joonsang Baek; Intae Kim

doi:10.1007/978-3-030-89432-0_11

Pattern Matching over Encrypted Data with a Short Ciphertext

Jongkil Kim, Willy Susilo, Yang Wai Chow, Joonsang Baek, Intae Kim

Department of Cyber Security

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

In this paper, we propose a new searchable encryption with shiftable trapdoor (SEST) scheme to enable pattern matching over encrypted data. In the proposed scheme, data is encrypted per character and the trapdoor for searching can be shifted. This implies that the trapdoor can be created over any string, which is not necessarily pre-defined. Also, it does not require any additional data tokenization method, which will expand the ciphertext size. As ciphertext size increases with the size of data, it is imperative to reduce ciphertext size in the SEST scheme as the matching operation requires expensive pairing computations proportional to the ciphertext length. Our work reduces the ciphertext size by up to 50% of the state-of-art scheme in this research domain while maintaining the same level of search efficiency.

Original language	English
Title of host publication	Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers
Editors	Hyoungshick Kim
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	132-143
Number of pages	12
ISBN (Print)	9783030894313
DOIs	https://doi.org/10.1007/978-3-030-89432-0_11
State	Published - 2021
Event	22nd World Conference on Information Security Application, WISA 2021 - Jeju, Korea, Republic of Duration: 11 Aug 2021 → 13 Aug 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13009 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	22nd World Conference on Information Security Application, WISA 2021
Country/Territory	Korea, Republic of
City	Jeju
Period	11/08/21 → 13/08/21

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Access to Document

10.1007/978-3-030-89432-0_11

Cite this

Kim, J., Susilo, W., Chow, Y. W., Baek, J., & Kim, I. (2021). Pattern Matching over Encrypted Data with a Short Ciphertext. In H. Kim (Ed.), Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers (pp. 132-143). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13009 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-89432-0_11

Kim, Jongkil ; Susilo, Willy ; Chow, Yang Wai et al. / Pattern Matching over Encrypted Data with a Short Ciphertext. Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers. editor / Hyoungshick Kim. Springer Science and Business Media Deutschland GmbH, 2021. pp. 132-143 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{56a1a8353c414462b04f9109a6918ee9,

title = "Pattern Matching over Encrypted Data with a Short Ciphertext",

abstract = "In this paper, we propose a new searchable encryption with shiftable trapdoor (SEST) scheme to enable pattern matching over encrypted data. In the proposed scheme, data is encrypted per character and the trapdoor for searching can be shifted. This implies that the trapdoor can be created over any string, which is not necessarily pre-defined. Also, it does not require any additional data tokenization method, which will expand the ciphertext size. As ciphertext size increases with the size of data, it is imperative to reduce ciphertext size in the SEST scheme as the matching operation requires expensive pairing computations proportional to the ciphertext length. Our work reduces the ciphertext size by up to 50% of the state-of-art scheme in this research domain while maintaining the same level of search efficiency.",

author = "Jongkil Kim and Willy Susilo and Chow, {Yang Wai} and Joonsang Baek and Intae Kim",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 22nd World Conference on Information Security Application, WISA 2021 ; Conference date: 11-08-2021 Through 13-08-2021",

year = "2021",

doi = "10.1007/978-3-030-89432-0_11",

language = "English",

isbn = "9783030894313",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "132--143",

editor = "Hyoungshick Kim",

booktitle = "Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers",

}

Kim, J, Susilo, W, Chow, YW, Baek, J & Kim, I 2021, Pattern Matching over Encrypted Data with a Short Ciphertext. in H Kim (ed.), Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13009 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 132-143, 22nd World Conference on Information Security Application, WISA 2021, Jeju, Korea, Republic of, 11/08/21. https://doi.org/10.1007/978-3-030-89432-0_11

Pattern Matching over Encrypted Data with a Short Ciphertext. / Kim, Jongkil; Susilo, Willy; Chow, Yang Wai et al.
Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers. ed. / Hyoungshick Kim. Springer Science and Business Media Deutschland GmbH, 2021. p. 132-143 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13009 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Pattern Matching over Encrypted Data with a Short Ciphertext

AU - Kim, Jongkil

AU - Susilo, Willy

AU - Chow, Yang Wai

AU - Baek, Joonsang

AU - Kim, Intae

PY - 2021

Y1 - 2021

N2 - In this paper, we propose a new searchable encryption with shiftable trapdoor (SEST) scheme to enable pattern matching over encrypted data. In the proposed scheme, data is encrypted per character and the trapdoor for searching can be shifted. This implies that the trapdoor can be created over any string, which is not necessarily pre-defined. Also, it does not require any additional data tokenization method, which will expand the ciphertext size. As ciphertext size increases with the size of data, it is imperative to reduce ciphertext size in the SEST scheme as the matching operation requires expensive pairing computations proportional to the ciphertext length. Our work reduces the ciphertext size by up to 50% of the state-of-art scheme in this research domain while maintaining the same level of search efficiency.

AB - In this paper, we propose a new searchable encryption with shiftable trapdoor (SEST) scheme to enable pattern matching over encrypted data. In the proposed scheme, data is encrypted per character and the trapdoor for searching can be shifted. This implies that the trapdoor can be created over any string, which is not necessarily pre-defined. Also, it does not require any additional data tokenization method, which will expand the ciphertext size. As ciphertext size increases with the size of data, it is imperative to reduce ciphertext size in the SEST scheme as the matching operation requires expensive pairing computations proportional to the ciphertext length. Our work reduces the ciphertext size by up to 50% of the state-of-art scheme in this research domain while maintaining the same level of search efficiency.

UR - http://www.scopus.com/inward/record.url?scp=85118989109&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-89432-0_11

DO - 10.1007/978-3-030-89432-0_11

M3 - Conference contribution

AN - SCOPUS:85118989109

SN - 9783030894313

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 132

EP - 143

BT - Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers

A2 - Kim, Hyoungshick

PB - Springer Science and Business Media Deutschland GmbH

T2 - 22nd World Conference on Information Security Application, WISA 2021

Y2 - 11 August 2021 through 13 August 2021

ER -

Kim J, Susilo W, Chow YW, Baek J, Kim I. Pattern Matching over Encrypted Data with a Short Ciphertext. In Kim H, editor, Information Security Applications - 22nd International Conference, WISA 2021, Revised Selected Papers. Springer Science and Business Media Deutschland GmbH. 2021. p. 132-143. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-89432-0_11

Pattern Matching over Encrypted Data with a Short Ciphertext

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Fingerprint

Cite this