Multi-source multi-client searchable symmetric encryption with post-compromise security
Yue GE , Ying GAO , Yunhao LING , Jianxin GAO
Front. Comput. Sci. ›› 2027, Vol. 21 ›› Issue (4) : 2104801
As multi-source data sharing becomes increasingly prevalent in the digital economy, multi-source multi-client dynamic searchable symmetric encryption (MM-DSSE) has received significant attention. However, the complex key management of MM-DSSE exacerbates the cascading effect of key compromise risks. Existing MM-DSSE schemes only satisfy forward privacy and rely on the ideal “key non-compromised” assumption. We study the key compromise threat in the MM-DSSE and formally define the post-compromise security for MM-DSSE with respect to leakage functions. We introduce a framework for MM-DSSE that supports non-interactive key updates for data sources and clients, named Mosaic. Mosaic ensures data security even in the event of key compromise at any client, data source, or management center. Additionally, we construct an instance MosaicR based on Mosaic that supports range search. Both Mosaic and MosaicR satisfy forward and type-II backward privacy. We conduct comprehensive experimental evaluations using real-world datasets. The results show that Mosaic and MosaicR ensure strong security and competitive performance. Compared with the state-of-the-art single-user DSSE scheme with post-compromise security Bamboo, Mosaic achieves a 79.21% improvement in total search efficiency. The index storage overhead of MosaicR is reduced by 49.98% compared with the range search scheme (RS)2.
multi source / multi client / dynamic searchable symmetric encryption / key compromise / forward and backward privacy
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
Chang Y C, Mitzenmacher M. Privacy preserving keyword searches on remote encrypted data. In: Proceedings of the 3rd international conference on Applied Cryptography and Network Security. 2005, 442–455 |
| [5] |
|
| [6] |
Bost R, Minaud B, Ohrimenko O. Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1465–1482 |
| [7] |
|
| [8] |
Sun S F, Yuan X, Liu J K, Steinfeld R, Sakzad A, Vo V, Nepal S. Practical backward-secure searchable encryption from symmetric puncturable encryption. In: Proceedings of 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018, 763–780 |
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
Bost R. ∑oφoς: forward secure searchable encryption. In: Proceedings of 2016 ACM SIGSAC Conference on Computer and Communications Security. 2016, 1143–1154 |
| [27] |
Kim K S, Kim M, Lee D, Park J H, Kim W H. Forward secure dynamic searchable symmetric encryption with efficient updates. In: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1449–1463 |
| [28] |
Etemad M, Küpçü A, Papamanthou C, Evans D. Efficient dynamic searchable encryption with forward privacy. In: Proceedings of the 17th Privacy Enhancing Technologies Symposium. 2017, 5-10 |
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
Ghareh Chamani J, Papadopoulos D, Papamanthou C, Jalili R. New constructions for forward and backward private symmetric searchable encryption. In: Proceedings of 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018, 1038–1055 |
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
Wang J, Chow S S M. Forward and backward-secure range-searchable symmetric encryption. In: Proceedings of the 22nd Privacy Enhancing Technologies Symposium. 2022, 28-48 |
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
Higher Education Press
/
| 〈 |
|
〉 |