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 | |
| Publication status | Published - 2018 Jan 1 |
| 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 | China |
| City | Guangzhou |
| Period | 18/11/15 → 18/11/17 |
Fingerprint
Keywords
- Forward privacy
- Keyword search
- Searchable encryption
- Searchable symmetric encryption
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
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, 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
}
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/1/1
Y1 - 2018/1/1
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
UR - http://www.scopus.com/inward/citedby.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
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
ER -