基于布隆过滤器和B+树构建倒排索引的电子病历密文搜索  

SEARCH ON ENCRYPTED ELECTRONIC MEDICAL RECORDS USING INVERTED INDEX BASED ON BLOOM FILTER AND B+TREE

作　　者：王莱 周腾达 王正飞 洪佳明[1] Wang Lai;Zhou Tengda;Wang Zhengfei;Hong Jiaming(School of Medical Information Engineering,Guangzhou University of Chinese Medicine,Guangzhou 510006,Guangdong,China)

机构地区：[1]广州中医药大学医学信息工程学院,广东广州510006

出　　处：《计算机应用与软件》2021年第4期276-280,333,共6页Computer Applications and Software

基　　金：广东省自然科学基金项目(2015A030310312);广州中医药大学人文社会科学“远志”项目(SKYZ1604)。

摘　　要：电子病历包含病人的隐私信息,如何在保密情况下进行电子病历内容搜索是医院电子病历数据有效利用的难点。针对电子病历密文搜索,提出一种基于布隆过滤器(BF)和B+树的快速搜索方法。该技术对电子病历建立BF,按照倒排索引方式组织起来并建立B+树,能够支持在不泄露用户搜索关键词的前提下,对电子病历密文直接进行查询,安全级别达到IND-CKA级别。实验结果表明:由于使用BF与B+树结构,空间过滤特性高,无须解密即可达99%的过滤效率,查询效率高,且支持布尔查询,有效促进加密电子病历数据的应用。The electronic medical record contains the patients privacy information.It is difficult to search the contents of electronic medical records in a confidential situation of the effective utilization of the hospital s electronic medical record data.Aiming at ciphertext search of electronic medical records,a fast search method based on bloom filter(BF)and B+tree is proposed.The BF of electronic medical record was established,and B+tree was established according to inverted index mode.It could support direct query of electronic medical record ciphertext without disclosing users search keywords,and the security level reached IND-CKA level.The experimental results show that due to the use of BF and B+tree structure,the spatial filtering characteristics are high,the filtering efficiency can reach 99%without decryption,and the query efficiency is high.It supports Boolean query,which effectively promotes the application of encrypted electronic medical record data.

关 键 词：电子病历 布隆过滤器 B+树 倒排索引 密文查询 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]