Skip to main content
placeholder image

Pattern Matching over Encrypted Data with a Short Ciphertext

Conference Paper


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.

Publication Date


  • 2021

Citation


  • Kim, J., Susilo, W., Chow, Y. W., Baek, J., & Kim, I. (2021). Pattern Matching over Encrypted Data with a Short Ciphertext. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 13009 LNCS (pp. 132-143). doi:10.1007/978-3-030-89432-0_11

Scopus Eid


  • 2-s2.0-85118989109

Start Page


  • 132

End Page


  • 143

Volume


  • 13009 LNCS

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.

Publication Date


  • 2021

Citation


  • Kim, J., Susilo, W., Chow, Y. W., Baek, J., & Kim, I. (2021). Pattern Matching over Encrypted Data with a Short Ciphertext. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 13009 LNCS (pp. 132-143). doi:10.1007/978-3-030-89432-0_11

Scopus Eid


  • 2-s2.0-85118989109

Start Page


  • 132

End Page


  • 143

Volume


  • 13009 LNCS