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

doi:10.1007/978-3-030-05063-4_8

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 proceeding › Conference contribution

6 Citations (Scopus)

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 language	English
Title of host publication	Algorithms and Architectures for Parallel Processing - 18th International Conference, ICA3PP 2018, Proceedings
Editors	Jaideep Vaidya, Jin Li
Publisher	Springer Verlag
Pages	85-97
Number of pages	13
ISBN (Print)	9783030050627
DOIs	https://doi.org/10.1007/978-3-030-05063-4_8
Publication status	Published - 2018
Event	18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018 - Guangzhou, China Duration: 2018 Nov 15 → 2018 Nov 17

Publication series

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

Other

Other	18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018
Country/Territory	China
City	Guangzhou
Period	18/11/15 → 18/11/17

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2018.

Keywords

Forward privacy
Keyword search
Searchable encryption
Searchable symmetric encryption

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

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, Proceedings (pp. 85-97). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11337 LNCS). Springer Verlag. 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 et al.
Algorithms and Architectures for Parallel Processing - 18th International Conference, ICA3PP 2018, Proceedings. ed. / Jaideep Vaidya; Jin Li. Springer Verlag, 2018. p. 85-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11337 LNCS).

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

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, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11337 LNCS, Springer Verlag, pp. 85-97, 18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018, Guangzhou, China, 18/11/15. https://doi.org/10.1007/978-3-030-05063-4_8

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, Proceedings. Springer Verlag. 2018. p. 85-97. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-05063-4_8

Lv, Siyi ; Huang, Yanyu ; Li, Bo et al. / Forward secure searchable encryption using key-based blocks chain technique. Algorithms and Architectures for Parallel Processing - 18th International Conference, ICA3PP 2018, Proceedings. editor / Jaideep Vaidya ; Jin Li. Springer Verlag, 2018. pp. 85-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b1447de560834cdcb565cdb4eba4f235,

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}",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018 ; Conference date: 15-11-2018 Through 17-11-2018",

year = "2018",

doi = "10.1007/978-3-030-05063-4_8",

language = "English",

isbn = "9783030050627",

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

publisher = "Springer Verlag",

pages = "85--97",

editor = "Jaideep Vaidya and Jin Li",

booktitle = "Algorithms and Architectures for Parallel Processing - 18th International Conference, ICA3PP 2018, Proceedings",

}

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 contribution

AN - SCOPUS:85058626402

SN - 9783030050627

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

SP - 85

EP - 97

BT - Algorithms and Architectures for Parallel Processing - 18th International Conference, ICA3PP 2018, Proceedings

A2 - Vaidya, Jaideep

A2 - Li, Jin

PB - Springer Verlag

T2 - 18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018

Y2 - 15 November 2018 through 17 November 2018

ER -

Forward secure searchable encryption using key-based blocks chain technique

Abstract

Publication series

Other

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this