A Searchable Symmetric Encryption Scheme Based on SRE

Huang Yicai; Yu Bin; Li Sensen

doi:10.7544/issn1000-1239.202220267

Journal of Computer Research and Development > 2023 > 60(12): 2725-2736. > DOI: 10.7544/issn1000-1239.202220267

Huang Yicai, Yu Bin, Li Sensen. A Searchable Symmetric Encryption Scheme Based on SRE[J]. Journal of Computer Research and Development, 2023, 60(12): 2725-2736. DOI: 10.7544/issn1000-1239.202220267

Citation:

Huang Yicai, Yu Bin, Li Sensen. A Searchable Symmetric Encryption Scheme Based on SRE[J]. Journal of Computer Research and Development, 2023, 60(12): 2725-2736. DOI: 10.7544/issn1000-1239.202220267

Citation:

Huang Yicai, Yu Bin, Li Sensen. A Searchable Symmetric Encryption Scheme Based on SRE[J]. Journal of Computer Research and Development, 2023, 60(12): 2725-2736. DOI: 10.7544/issn1000-1239.202220267

PDF (1863 KB)

A Searchable Symmetric Encryption Scheme Based on SRE

Information Engineering University, Zhengzhou 450001

Funds: This work was supported by the National Natural Science Foundation of China (61772547).

More Information

Author Bio:
Huang Yicai: born in 1985. PhD candidate. His main research interests include IoT, secure cloud storage system, and searchable encryption

Yu Bin: born in 1964. PhD, professor, PhD supervisor. His main research interests include the design and analysis of algorithms, visual cryptography, and network security

Li Sensen: born in 1993. PhD candidate. His main research interests include network security and wireless communication technology
Received Date: March 30, 2022
Revised Date: February 23, 2023
Available Online: September 19, 2023

Graphical Abstract

Abstract

Abstract

DSSE (dynamic searchable symmetric encryption), which has forward/backward privacy and high search efficiency, supports addition and deletion of encrypted index. Relevant research has been a hot spot and many new schemes have been constructed in recent years, such as Aura. Aiming at the problems of high ciphertext storage overhead and mistaken deletion in Aura scheme, a more strict correctness definition of SRE (symmetric revokable encryption) primitive is given, and the condition of mistaken deletion is analyzed theoretically. In addition, an insertion position selection algorithm is designed to avoid node reuse due to Hash collision. On this basis, a searchable symmetric encryption scheme based on SRE is constructed by adding a deletion list and using a t-puncturable pseudorandom function. Puncturing all unused nodes at one time, the scheme not only effectively reduces the computing overhead on the cloud server during search phase, but also avoids revealing unused keys and gains better security. Finally, the scheme is analyzed in terms of search efficiency, storage overhead, communication overhead and security. Theoretical analysis and experimental results show that the scheme can effectively reduce the space overhead of ciphertext storage on the server, avoid the mistaken deletion, and improve the search efficiency on large-scale nodes.

FullText(HTML)

References (25)

References

[1]	Song Xiaodong, Wagner D, Perrig A. Practical techniques for searches on encrypted data[C] // Proc of the 21st IEEE Symp on Security and Privacy. Piscataway, NJ: IEEE, 2000: 44−55
[2]	Goh E J. Secure indexes [EB/OL]. Cryptography Archive. 2003[2021-03-01]. http://eprint.iacr.org/2003/216
[3]	Naveed M, Prabhakaran M, Gunter C A. Dynamic searchable encryption via blind storage[C] // Proc of the 35th IEEE Symp on Security and Privacy. Piscataway, NJ: IEEE, 2014: 639−654
[4]	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
[5]	Hahn F, Kerschbaum F. Searchable encryption with secure and efficient updates[C] // Proc of the ACM Conf on Computer and Communications Security. New York: ACM, 2014: 310−320
[6]	Ghareh C J, Papadopoulos D, Papamanthou C, et al. New constructions for forward and backward private symmetric searchable encryption[C] // Proc of the 2018 ACM SIGSAC Conf on Computer and Communications Security(CCS’18). New York: ACM, 2018: 1038−1055
[7]	Naveed M. The fallacy of composition of oblivious RAM and searchable encryption[EB/OL]. 2015[2021-06-20]. https://eprint.iacr.org/2015/668
[8]	Kamara S, Papamanthou C. Parallel and dynamic searchable symmetric encryption[G] // LNCS 7859: Proc of the 17th Financial Cryptography and Data Security. Berlin: Springer, 2013: 258–274
[9]	Song Xiangfu, Dong Changyu, Yuan Dandan, et al. Forward private searchable symmetric encryption with optimized I/O efficiency[J]. IEEE Transactions on Dependable and Secure Computing, 2020, 17(5): 912−927 doi: 10.1109/TDSC.2018.2822294
[10]	Bossuat A, Bost R, Fouque P A, et al. SSE and SSD: Page-efficient searchable symmetric encryption[EB/OL]. 2021[2021-10-21].https://eprint.iacr.org/2021/716
[11]	He Kun, Chen Jing, Zhou Qinxi, et al. Secure dynamic searchable symmetric encryption with constant client storage cost[J]. IEEE Transactions Information Forensics and Security, 2021, 16: 1538−1549 doi: 10.1109/TIFS.2020.3033412
[12]	Bost R, Minaud B, Ohrimenko O. Forward and backward private searchable encryption from constrained cryptographic primitives[C] //Proc of ACM SIGSAC Conf on Computer and Communications Security. New York: ACM, 2017: 1465−1482
[13]	Bost R. ∑oφoς: Forward secure searchable encryption[C] // Proc of ACM SIGSAC Conf on Computer and Communications Security. New York: ACM, 2016: 1143−1154
[14]	Etemad M, Küp ü A, Papamanthou C, et al. Efficient dynamic searchable encryption with forward privacy[J]. Proceedings on Privacy Enhancing Technologies, 2018(1): 5−20
[15]	Wang Qiao, Guo Yu, Huang Hejiao, et al. Multi-user forward secure dynamic searchable symmetric encryption[G] // LNCS 11058: Proc of Symp on NSS 2018. Berlin: Springer, 2018: 125−140
[16]	Li Jin, Huang Yanyu, Wei Yu, et al. Searchable symmetric encryption with forward search privacy[J]. IEEE Transactions on Dependable and Secure Computing, 2021, 18(1): 460−474 doi: 10.1109/TDSC.2019.2894411
[17]	Huang Ke, Dong Xiaolei, Cao Zhenfu, et al. Dynamic searchable symmetric encryption schemes with forward and backward security[C/OL] // Proc of IOP Conf Series: Materials Science and Engineering. 2020[2023-01-16].https://iopscience.iop.org/article/10.1088/1757−899X/715/1/012062
[18]	Zuo Cong, Sun Shifeng, Liu J K, et al. Forward and backward private DSSE for range queries[J]. IEEE Transactions on Dependable and Secure Computing, 2022, 19(1): 328−338 doi: 10.1109/TDSC.2020.2994377
[19]	Amjad G, Kamara S, Moataz T. Forward and backward private searchable encryption with SGX[C] // Proc of ACM Conf on EuroSec’19. New York: ACM, 2019: 1143−1154
[20]	Sun Shifeng, Yuan Xingliang, Joseph K L, et al. Practical backward-secure searchable encryption from symmetric puncturable encryption[C] //Proc of the 2018 ACM SIGSAC Conf on Computer and Communications Security(CCS’18). New York: ACM, 2018: 763−780
[21]	Hohenberger S, Koppula V, Waters B. Adaptively secure puncturable pseudorandom functions in the standard model[G] // LNCS 9452: Proc of Advances in Cryptology (ASIACRYPT 2015). Berlin: Springer, 2015: 79–102
[22]	Sun Shifeng, Steinfeld R, Lai Shangqi, et al. Practical non-interactive searchable encryption with forward and backward privacy[C/OL] // Proc of Symp on Network and Distributed Systems Security (NDSS). 2021[2022-01-23].https://dx. doi.org/10.14722/ndss.2021.24162
[23]	Ray I G, Rahulamathavan Y, Rajarajan M. A new lightweight symmetric searchable encryption scheme for string identification[J]. IEEE Transactions on Cloud Computing, 2020, 8(3): 672−684
[24]	Zhang Yupeng, Jonathan K, Charalampos P. All your queries are belong to us: The power of file-injection attacks on searchable encryption[C] // Proc of Symp on USENIX Security. Berkeley, CA: USENIX Association. 2016: 707–720
[25]	王贇玲,陈晓峰. 对称可搜索加密技术研究进展[J]. 电子与信息学报,2020,42(10):2374−2385 doi: 10.11999/JEIT190890 Wang Yunling, Chen Xiaofeng. Research on searchable symmetric encryption[J]. Journal of Electronics & Information Technology, 2020, 42(10): 2374−2385 (in Chinese) doi: 10.11999/JEIT190890

[1]	Lin Liansheng, Zheng Huanqin, Su Shen, Lei Kai, Chen Xiaofeng, Tian Zhihong. An On-Chain Mechanism Against DeFi Price Manipulation Attacks[J]. Journal of Computer Research and Development, 2025, 62(2): 443-457. DOI: 10.7544/issn1000-1239.202330291
[2]	Song Shuwei, Ni Xiaoze, Chen Ting. Gas Optimization for Smart Contracts: A Survey[J]. Journal of Computer Research and Development, 2023, 60(2): 311-325. DOI: 10.7544/issn1000-1239.202220887
[3]	Ying Chenhao, Xia Fuyuan, Li Jie, Si Xueming, Luo Yuan. Incentive Mechanism Based on Truth Estimation of Private Data for Blockchain-Based Mobile Crowdsensing[J]. Journal of Computer Research and Development, 2022, 59(10): 2212-2232. DOI: 10.7544/issn1000-1239.20220493
[4]	Feng Jingyu, Yang Jinwen, Zhang Ruitong, Zhang Wenbo. A Spectrum Sharing Incentive Scheme Against Location Privacy Leakage in IoT Networks[J]. Journal of Computer Research and Development, 2020, 57(10): 2209-2220. DOI: 10.7544/issn1000-1239.2020.20200453
[5]	Hai Mo, Zhu Jianming. A Propagation Mechanism Combining an Optimal Propagation Path and Incentive in Blockchain Networks[J]. Journal of Computer Research and Development, 2019, 56(6): 1205-1218. DOI: 10.7544/issn1000-1239.2019.20180419
[6]	He Yunhua, Li Mengru, Li Hong, Sun Limin, Xiao Ke, Yang Chao. A Blockchain Based Incentive Mechanism for Crowdsensing Applications[J]. Journal of Computer Research and Development, 2019, 56(3): 544-554. DOI: 10.7544/issn1000-1239.2019.20170670
[7]	He Haiwu, Yan An, Chen Zehua. Survey of Smart Contract Technology and Application Based on Blockchain[J]. Journal of Computer Research and Development, 2018, 55(11): 2452-2466. DOI: 10.7544/issn1000-1239.2018.20170658
[8]	Xiong Jinbo, Ma Rong, Niu Ben, Guo Yunchuan, Lin Li. Privacy Protection Incentive Mechanism Based on User-Union Matching in Mobile Crowdsensing[J]. Journal of Computer Research and Development, 2018, 55(7): 1359-1370. DOI: 10.7544/issn1000-1239.2018.20180080
[9]	Wang Bo, Huang Chuanhe, Yang Wenzhong, Dan Feng, and Xu Liya. An Incentive-Cooperative Forwarding Model Based on Punishment Mechanism in Wireless Ad Hoc Networks[J]. Journal of Computer Research and Development, 2011, 48(3): 398-406.
[10]	Yue Guangxue, Li Renfa, Chen Zhi, Zhou Xu. Analysis of Free-riding Behaviors and Modeling Restrain Mechanisms for Peer-to-Peer Networks[J]. Journal of Computer Research and Development, 2011, 48(3): 382-397.

Cited By

Cited by

Periodical cited type(2)

1.	李硕，王馨爽. 多场景融合的码号数据分发架构及关键技术研究. 数据通信. 2024(06): 1-3+11 .
2.	俞惠芳，李磊. 基于椭圆曲线签密的跨链医疗数据共享方案. 通信学报. 2024(12): 57-66 .