信息网络安全

信息网络安全 ›› 2016, Vol. 16 ›› Issue (10): 28-33.doi: 10.3969/j.issn.1671-1122.2016.10.005

• • 上一篇    下一篇

加密数据库关键词快速检索方法研究

项军政1, 咸鹤群1,2(), 田程亮1,3, 李敏1   

  1. 1.青岛大学计算机科学技术学院,山东青岛 266071
    2.宾夕法尼亚州立大学,美国宾夕法尼亚 16802
    3.中国科学院信息工程研究所,北京 100093
  • 收稿日期:2016-09-07 出版日期:2016-10-31 发布日期:2020-05-13
  • 作者简介:

    作者简介： 项军政（1989—）,男,山东,硕士研究生,主要研究方向为信息安全;咸鹤群（1979—）,男,山东,副教授,博士,主要研究方向为网络与信息系统安全;田程亮（1983—）,男,山东,讲师,博士,主要研究方向为基于格的密码学、安全外包计算;李敏（1973—）,男,山东,副研究员,硕士,主要研究方向为信息安全。

  • 基金资助:
    国家自然科学基金[61303197];山东省自然科学基金[ZR2013FQ005]

Research on Method of Key Words Quick Search in Encrypted Databases

Junzheng XIANG1, Hequn XIAN1,2(), Chengliang TIAN1,3, Min LI1   

  1. 1.College of Computer Science and Technology, Qingdao University, Qingdao Shandong 266071, China
    2. The State University of Pennsylvania, Pennsylvania 16802, the USA
    3. Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
  • Received:2016-09-07 Online:2016-10-31 Published:2020-05-13

RichHTML

2

PDF (PC)

95

摘要：

数据库加密可以有效保护数据安全,传统的关键词检索操作很难在加密的数据库中高效执行。文章设计了一种基于bloom过滤器的加密关键词检索方法。该方法将每个关键词作为字符串进行处理,通过多个哈希函数进行映射,得到多个下标,将初始化全为0的bloom数组的这些下标位置的0变为1。检索时,对检索关键词也通过同样的哈希函数进行映射,得到多个下标,判断bloom数组的这些下标位置的值是否全为1,从而实现对加密数据的检索。文章还给出了bloom过滤器原理、误判率分析和哈希函数的介绍。实验表明,该方法具备较高的执行效率和实用性。

关键词: bloom过滤器, 加密数据库, 哈希函数

Abstract:

Database encryption is an efficient way to protect data security. Traditional key words query operation cannot be executed directly over encrypted databases. This paper designs an encrypted key words query method based on the bloom filter mechanism. In this method, key words are treated as strings, which are mapped by multiple hash functions and multiple indices are obtained. The bloom array is initialized to 0, and the value 0s of the positions corresponding to the indices of the bloom array are changed to 1s. When searching, the retrieved key words are mapped by the same hash functions and multiple indices are obtained. The search of the encrypted data is realized by judging whether the values of the positions corresponding to the indices of the bloom array are 1s. This paper also gives the introductions of the principle of bloom filter, error analysis and hash function. Experimental results show that the method has high efficiency and practicability.

Key words: bloom filter, encrypted database, hash function

中图分类号: