Forward secure searchable encryption using key-based blocks chain technique

Siyi Lv, Yanyu Huang, Bo Li, Yu Wei, Zheli Liu, Joseph K. Liu, Dong Hoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

Abstract

Searchable Symmetric Encryption (SSE) has been widely applied in the encrypted database for exact queries or even range queries in practice. In spite of it has excellent efficiency and complete functionality, it always suffers from information leakages. Some recent attacks point out that forward privacy is the vital security goal. However, there are only several schemes achieving this security. In this paper, we propose a new flexible forward secure SSE scheme referred to as “FFSSE”, which has the best performance in literature, such as fast search operation, fast token generation and O(1) update complexity. It also supports both add and delete operations in the unique instance. Technically, we exploit a novel “key-based blocks chain” technique based on symmetric cryptographic primitive, which can be deployed in arbitrary index tree structures or key-value structures directly to guarantee forward privacy.

Original languageEnglish
Title of host publicationAlgorithms and Architectures for Parallel Processing
Subtitle of host publication18th International Conference, ICA3PP 2018 Guangzhou, China, November 15–17, 2018 Proceedings, Part IV
EditorsJaideep Vaidya, Jin Li
Place of PublicationCham Switzerland
PublisherSpringer
Pages85-97
Number of pages13
ISBN (Electronic)9783030050634
ISBN (Print)9783030050627
DOIs
Publication statusPublished - 2018
EventInternational Conference on Algorithms and Architectures for Parallel Processing 2018 - Guangzhou, China
Duration: 15 Nov 201817 Nov 2018
Conference number: 18th
http://nsclab.org/ica3pp2018/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11337
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Algorithms and Architectures for Parallel Processing 2018
Abbreviated titleICA3PP 2018
CountryChina
CityGuangzhou
Period15/11/1817/11/18
Internet address

Keywords

  • Forward privacy
  • Keyword search
  • Searchable encryption
  • Searchable symmetric encryption

Cite this

Lv, S., Huang, Y., Li, B., Wei, Y., Liu, Z., Liu, J. K., & Lee, D. H. (2018). Forward secure searchable encryption using key-based blocks chain technique. In J. Vaidya, & J. Li (Eds.), Algorithms and Architectures for Parallel Processing : 18th International Conference, ICA3PP 2018 Guangzhou, China, November 15–17, 2018 Proceedings, Part IV (pp. 85-97). (Lecture Notes in Computer Science ; Vol. 11337 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-030-05063-4_8
Lv, Siyi ; Huang, Yanyu ; Li, Bo ; Wei, Yu ; Liu, Zheli ; Liu, Joseph K. ; Lee, Dong Hoon. / Forward secure searchable encryption using key-based blocks chain technique. Algorithms and Architectures for Parallel Processing : 18th International Conference, ICA3PP 2018 Guangzhou, China, November 15–17, 2018 Proceedings, Part IV. editor / Jaideep Vaidya ; Jin Li. Cham Switzerland : Springer, 2018. pp. 85-97 (Lecture Notes in Computer Science ).
@inproceedings{609c306c9c624e9e974fe34ab74441c3,
title = "Forward secure searchable encryption using key-based blocks chain technique",
abstract = "Searchable Symmetric Encryption (SSE) has been widely applied in the encrypted database for exact queries or even range queries in practice. In spite of it has excellent efficiency and complete functionality, it always suffers from information leakages. Some recent attacks point out that forward privacy is the vital security goal. However, there are only several schemes achieving this security. In this paper, we propose a new flexible forward secure SSE scheme referred to as “FFSSE”, which has the best performance in literature, such as fast search operation, fast token generation and O(1) update complexity. It also supports both add and delete operations in the unique instance. Technically, we exploit a novel “key-based blocks chain” technique based on symmetric cryptographic primitive, which can be deployed in arbitrary index tree structures or key-value structures directly to guarantee forward privacy.",
keywords = "Forward privacy, Keyword search, Searchable encryption, Searchable symmetric encryption",
author = "Siyi Lv and Yanyu Huang and Bo Li and Yu Wei and Zheli Liu and Liu, {Joseph K.} and Lee, {Dong Hoon}",
year = "2018",
doi = "10.1007/978-3-030-05063-4_8",
language = "English",
isbn = "9783030050627",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "85--97",
editor = "Jaideep Vaidya and Jin Li",
booktitle = "Algorithms and Architectures for Parallel Processing",

}

Lv, S, Huang, Y, Li, B, Wei, Y, Liu, Z, Liu, JK & Lee, DH 2018, Forward secure searchable encryption using key-based blocks chain technique. in J Vaidya & J Li (eds), Algorithms and Architectures for Parallel Processing : 18th International Conference, ICA3PP 2018 Guangzhou, China, November 15–17, 2018 Proceedings, Part IV. Lecture Notes in Computer Science , vol. 11337 , Springer, Cham Switzerland, pp. 85-97, International Conference on Algorithms and Architectures for Parallel Processing 2018, Guangzhou, China, 15/11/18. https://doi.org/10.1007/978-3-030-05063-4_8

Forward secure searchable encryption using key-based blocks chain technique. / Lv, Siyi; Huang, Yanyu; Li, Bo; Wei, Yu; Liu, Zheli; Liu, Joseph K.; Lee, Dong Hoon.

Algorithms and Architectures for Parallel Processing : 18th International Conference, ICA3PP 2018 Guangzhou, China, November 15–17, 2018 Proceedings, Part IV. ed. / Jaideep Vaidya; Jin Li. Cham Switzerland : Springer, 2018. p. 85-97 (Lecture Notes in Computer Science ; Vol. 11337 ).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Forward secure searchable encryption using key-based blocks chain technique

AU - Lv, Siyi

AU - Huang, Yanyu

AU - Li, Bo

AU - Wei, Yu

AU - Liu, Zheli

AU - Liu, Joseph K.

AU - Lee, Dong Hoon

PY - 2018

Y1 - 2018

N2 - Searchable Symmetric Encryption (SSE) has been widely applied in the encrypted database for exact queries or even range queries in practice. In spite of it has excellent efficiency and complete functionality, it always suffers from information leakages. Some recent attacks point out that forward privacy is the vital security goal. However, there are only several schemes achieving this security. In this paper, we propose a new flexible forward secure SSE scheme referred to as “FFSSE”, which has the best performance in literature, such as fast search operation, fast token generation and O(1) update complexity. It also supports both add and delete operations in the unique instance. Technically, we exploit a novel “key-based blocks chain” technique based on symmetric cryptographic primitive, which can be deployed in arbitrary index tree structures or key-value structures directly to guarantee forward privacy.

AB - Searchable Symmetric Encryption (SSE) has been widely applied in the encrypted database for exact queries or even range queries in practice. In spite of it has excellent efficiency and complete functionality, it always suffers from information leakages. Some recent attacks point out that forward privacy is the vital security goal. However, there are only several schemes achieving this security. In this paper, we propose a new flexible forward secure SSE scheme referred to as “FFSSE”, which has the best performance in literature, such as fast search operation, fast token generation and O(1) update complexity. It also supports both add and delete operations in the unique instance. Technically, we exploit a novel “key-based blocks chain” technique based on symmetric cryptographic primitive, which can be deployed in arbitrary index tree structures or key-value structures directly to guarantee forward privacy.

KW - Forward privacy

KW - Keyword search

KW - Searchable encryption

KW - Searchable symmetric encryption

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

U2 - 10.1007/978-3-030-05063-4_8

DO - 10.1007/978-3-030-05063-4_8

M3 - Conference Paper

SN - 9783030050627

T3 - Lecture Notes in Computer Science

SP - 85

EP - 97

BT - Algorithms and Architectures for Parallel Processing

A2 - Vaidya, Jaideep

A2 - Li, Jin

PB - Springer

CY - Cham Switzerland

ER -

Lv S, Huang Y, Li B, Wei Y, Liu Z, Liu JK et al. Forward secure searchable encryption using key-based blocks chain technique. In Vaidya J, Li J, editors, Algorithms and Architectures for Parallel Processing : 18th International Conference, ICA3PP 2018 Guangzhou, China, November 15–17, 2018 Proceedings, Part IV. Cham Switzerland: Springer. 2018. p. 85-97. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-030-05063-4_8