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
N1 - Funding Information:
Acknowledgment. This work was supported by the National Natural Science Foundation of China (No. 61672300), and National Natural Science Foundation of Tianjin (No. 16JCYBJC15500).
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
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
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 -