Research on Dynamic Searchable Encryption Method Based on Bloom Filter

Author:

Jin Ziqi1,Li Dongmei1,Zhang Xiaomei1,Cai Zhi2

Affiliation:

1. School of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai 201620, China

2. Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China

Abstract

Data outsourcing has become more and more popular due to its low cost and flexibility. However, there is a problem that the cloud server used to store data is partially trusted. Searchable encryption is an efficient technology that is devoted to helping people conduct accurate searches without leaking information. Nonetheless, most existing schemes cannot support dynamic updates or meet the privacy requirements of all users. There have been some experiments to solve these issues by implementing a dynamically searchable asymmetric encryption scheme. This paper proposes an efficient searchable encryption scheme based on the Authenticator Bloom Filter (ABF). The solution can support dynamic updates and multiple users and meet forward and backward security. This paper uses an ABF to improve the efficiency of searches and updates while playing a significant role in dynamic updates. This paper designs a new token encryption scheme and file set encryption scheme, which not only helps users reduce time in searches and updates but also supports multi-user modes. Experiments show that the proposed scheme takes less time in searching and updating algorithms, especially when the keyword does not exist. The solution also takes into account the problem of history storage when updating, which reduces the unnecessary consumption of memory and avoids multiple storage states for the same file.

Funder

Open Foundation of Shanghai Key Laboratory of Integrated Administration Technologies for Information Security

Scientific and Technological Innovation 2030—“New Generation Artificial Intelligence” Major Project

Shanghai Local Colleges and Universities Science and Technology Innovation Capacity-Building Project

Publisher

MDPI AG

Reference25 articles.

1. Chai, Q., and Gong, G. (2012, January 10–15). Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. Proceedings of the 2012 IEEE International Conference on Communications (ICC), Ottawa, ON, Canada.

2. Paverd, A., Martin, A., and Brown, I. (2014). Modelling and automatically analysing privacy properties for honest-but-curious adversaries. Tech. Rep., 1–14.

3. Song, D.X., Wagner, D., and Perrig, A. (2000, January 14–17). Practical techniques for searches on encrypted data. Proceedings of the Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000, Berkeley, CA, USA.

4. Curtmola, R., Garay, J., Kamara, S., and Ostrovsky, R. (2006, January 3). Searchable symmetric encryption: Improved definitions and efficient constructions. Proceedings of the 13th ACM Conference on Computer and Communications Security, Alexandria, VA, USA.

5. Chase, M., and Kamara, S. (2010). Advances in Cryptology-ASIACRYPT 2010: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, 5–9 December 2010, Springer. Proceedings 16.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3