Efficient Forward Secure Searchable Symmetric Encryption for Multi-user

MA Changshe; LI Xiaocong; CHEN Hailong

doi:10.6054/j.jscnun.2022092

Journal of South China Normal University (Natural Science Edition) > 2022 > 54(6): 109-118. > DOI: 10.6054/j.jscnun.2022092

MA Changshe, LI Xiaocong, CHEN Hailong. Efficient Forward Secure Searchable Symmetric Encryption for Multi-user[J]. Journal of South China Normal University (Natural Science Edition), 2022, 54(6): 109-118. DOI: 10.6054/j.jscnun.2022092

Citation:

PDF (1233 KB)

Efficient Forward Secure Searchable Symmetric Encryption for Multi-user

School of Computer Science, South China Normal University, Guangzhou 510631, China

More Information

Received Date: December 18, 2021
Available Online: February 13, 2023

Graphical Abstract

Abstract

Abstract

Most of the existing forward secure searchable encryption schemes are mainly for single-user settings and cannot be easily extended to multi-user settings since the keyword state is maintained locally; there are few forward secure schemes that support multi-user retrieval, and they require additional trusted proxy servers, which brings additional overhead and insufficient practicality. Aiming at the current lack of practical multi-user forward secure searchable encryption scheme, a searchable encryption scheme (EMFS) based on a two-chain index structure is designed, which meets forward security and supports multi-user retrieval without the need for a proxy server. The double-layer index consists of the main chain index and a slave chain index. The main chain index is generated by the one-way trapdoor function and the global state and does not depend on the separate state of each keyword, thus avoiding the synchronization problem of the keyword state among multiple users; the slave chain index is generated by stream cipher, which improves the search efficiency. Compared with three existing single-user forward security schemes (Sophos, FAST, BESTIE), the results show that the EMFS scheme has good scalability and practicability: (1) The EMFS scheme achieves the expansion of multi-user retrieval at a reasonable cost of search perfor-mance; (2) The EMFS scheme is especially suitable for matching datasets with a large number of files; (3) The EMFS scheme has the advantage of small client storage overhead.
- cloud storage,
- searchable symmetric encryption,
- forward security,
- multi-user

FullText(HTML)

References (19)

References

[1]	SONG D X, WAGNER D, PERRIG A. Practical techniques for searches on encrypted data[C]//Proceedings of the 2000 IEEE Symposium on Security and Privacy. Massachusetts: IEEE, 2000: 44-55.
[2]	GOH E J. Secure indexes[J]. IACR Cryptology ePrint Archive, 2003, 2003: 216/1-18.
[3]	CURTMOLA R, GARAY J, KAMARA S, et al. Searchable symmetric encryption: improved definitions and efficient constructions[C]//Proceedings of the 13th ACM Confe-rence on Computer and Communications Security. New York: ACM, 2006: 79-88.
[4]	CASH D, JARECKI S, JUTLA C, et al. Highly-scalable searchable symmetric encryption with support for boolean queries[C]//Advances in Cryptology-CRYPTO 2013. Berlin: Springer, 2013: 353-373.
[5]	SUN S F, LIU J K, SAKZAD A, et al. An efficient non-interactive multi-client searchable encryption with support for boolean queries[C]//European Symposium on Research in Computer Security. Cham: Springer, 2016: 154-172.
[6]	孙僖泽, 周福才, 李宇溪, 等. 基于可搜索加密机制的数据库加密方案[J]. 计算机学报, 2021, 44(4): 806-819. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJX202104009.htm SUN X Z, ZHOU F C, LI Y X, et al. A database encryption scheme based on searchable encryption[J]. Chinese Journal of Computers, 2021, 44(4): 806-819. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJX202104009.htm
[7]	KAMARA S, PAPAMANTHOU C, ROEDER T. Dynamic searchable symmetric encryption[C]//Proceedings of the 2012 ACM Conference on Computer and Communications Security. Raleigh: ACM, 2012: 965-976
[8]	ZHANG Y P, KATZ J, PAPAMANTHOU C. All your queries are belong to us: the power of file-injection attacks on searchable encryption[C]//Proceedings of the 25th USENIX Conference on Security Symposium. Austin: USENIX Association, 2016: 707-720.
[9]	STEFANOV E, PAPAMANTHOU C, SHI E. Practical dynamic searchable encryption with small leakage[C]// Proceedings of the 21th Annual Network and Distributed System Security Symposium. San Diego: The Internet Society, 2014: 72-75.
[10]	GARG S, MOHASSEL P, PAPAMANTHOU C. TWORAM: round-optimal oblivious RAM with applications to searchable encryption[J]. Cryptology ePrint Archive, 2015, 2015: 1010/1-29.
[11]	BOST R. ∑ oφoς: Forward secure searchable encryption[C]//Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. Vienna: ACM, 2016: 1143-1154.
[12]	HE K, CHEN J, ZHOU Q X, et al. Secure dynamic searchable symmetric encryption with constant client sto-rage cost[J]. IEEE Transactions on Information Forensics and Security, 2020, 16: 1538-1549.
[13]	ETEMAD M, KÜPÇÜ, PAPAMANTHOU C, et al. Efficient dynamic searchable encryption with forward privacy[J]. Proceedings on Privacy Enhancing Technologies, 2018, 1: 5-20.
[14]	SONG X F, DONG C Y, YUAN D D, et al. Forward private searchable symmetric encryption with optimized I/O efficiency[J]. IEEE Transactions on Dependable and Secure Computing, 2018, 17(5): 912-927.
[15]	CURTMOLA R, GARAY J, KAMARA S, et al. Searchable symmetric encryption: improved definitions and efficient constructions[J]. Journal of Computer Security, 2011, 19(5): 895-934.
[16]	WANG Q, GUO Y, HUANG H J, et al. Multi-user forward secure dynamic searchable symmetric encryption[C]//Proceedings of International Conference on Network and System Security. Cham: Springer, 2018: 125-140.
[17]	BAKAS A, MICHALAS A. Multi-client symmetric searchable encryption with forward privacy[J]. Cryptology ePrint Archive, 2019, 2019: 813/1-15.
[18]	CHEN T Y, XU P, WANG W, et al. Bestie: Very practical searchable encryption with forward and backward security[C]//European Symposium on Research in Computer Security. Cham: Springer, 2021: 3-23.
[19]	RIVEST R L, SHAMIR A, ADLEMAN L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126.

Cited By

Get Citation

PDF

XML

Article views (266) PDF downloads (38)

Turn off MathJax

Article Contents

Abstract

References

Efficient Forward Secure Searchable Symmetric Encryption for Multi-user

Abstract

References

Catalog

Export File

Citation

Format

Content