基于编码树的频率隐藏保序加密方案设计  

Design of Frequency Hiding Sequence-Preserving Encryption Scheme Based on Encoding Tree

作　　者：张海政 马利民 王佳慧 张伟[1] ZHANG Hai-zheng;MA Li-min;WANG Jia-hui;ZHANG Wei(College of Computer Science,Beijing Information Science and Technology University,Beijing 100101,China;Department of Information and Security,State Information Center,Beijing 100045,China)

机构地区：[1]北京信息科技大学计算机学院,北京100101 [2]国家信息中心信息与网络安全部,北京100045

出　　处：《计算机仿真》2024年第9期489-493,504,共6页Computer Simulation

摘　　要：针对现有保序加密方案中存在泄露明文分布频率以及在数据频繁插入的场景下性能较低的问题,通过在数据插入阶段随机生成[0,M]内的随机数作为临时保序编码,在数据查询阶段采用二级索引的形式最终确定密文对应的保序编码,来解决明文频率泄露的问题;针对保序编码频繁更新引发性能较低的问题,改进现有的更新策略,只有在客户端执行查询操作时,才进行编码的更新,提升算法的性能。实验数据和理论分析表明,所提出的保序加密方案在隐藏明文分布频率的同时,插入5000条数据,提升了16%的性能。In response to the problems of leaking plaintext distribution frequency and low performance in frequent data insertion scenarios in existing order preserving encryption schemes,a temporary order preserving code is generated by randomly generating a random number within [0,M] during the data insertion stage,and finally determining the order preserving code corresponding to the ciphertext in the form of a secondary index during the data query stage to solve the problem of plaintext frequency leakage.To solve the problem of low performance caused by frequent updates of the order-preserving encoding,the existing update strategy is improved.The encoding is updated only when the client executes the query operation,so as to improve the performance of the algorithm.Experimental data and theoretical analysis show that the sequence-preserving encryption scheme proposed in this paper improves the performance by 16% by inserting 5000 pieces of data while hiding the plaintext distribution frequency.

关 键 词：数据库安全 保序加密 频率隐藏 统计攻击 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]