An efficient conjunctive keyword searchable encryption for cloud-based IoT systems✩
Tianqi Peng , Bei Gong , Chong Guo , Akhtar Badshah , Muhammad Waqas , Hisham Alasmary , Sheng Chen
›› 2025, Vol. 11 ›› Issue (4) : 1293 -1304.
An efficient conjunctive keyword searchable encryption for cloud-based IoT systems✩
Data privacy leakage has always been a critical concern in cloud-based Internet of Things (IoT) systems. Dynamic Symmetric Searchable Encryption (DSSE) with forward and backward privacy aims to address this issue by enabling updates and retrievals of ciphertext on untrusted cloud server while ensuring data privacy. However, previous research on DSSE mostly focused on single keyword search, which limits its practical application in cloud-based IoT systems. Recently, Patranabis (NDSS 2021) [1] proposed a groundbreaking DSSE scheme for conjunctive keyword search. However, this scheme fails to effectively handle deletion operations in certain circumstances, resulting in inaccurate query results. Additionally, the scheme introduces unnecessary search overhead. To overcome these problems, we present CKSE, an efficient conjunctive keyword DSSE scheme. Our scheme improves the oblivious shared computation protocol used in the scheme of Patranabis, thus enabling a more comprehensive deletion functionality. Furthermore, we introduce a state chain structure to reduce the search overhead. Through security analysis and experimental evaluation, we demonstrate that our CKSE achieves more comprehensive deletion functionality while maintaining comparable search performance and security, compared to the oblivious dynamic cross-tags protocol of Patranabis. The combination of comprehensive functionality, high efficiency, and security makes our CKSE an ideal choice for deployment in cloud-based IoT systems.
Symmetric searchable encryption / Conjunctivesearch / Forward and backward privacy / Cloud server
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
| [48] |
|
| [49] |
|
| [50] |
|
| [51] |
|
| [52] |
|
| [53] |
D.J. Bernstein, Curve25519: new Diffie-Hellman speed records,in: Public Key Cryptography-PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. Proceedings 9, Springer, 2006, pp. 207-228. |
| [54] |
|
| [55] |
|
/
| 〈 |
|
〉 |