计算机应用 ›› 2020, Vol. 40 ›› Issue (10): 2986-2991.DOI: 10.11772/j.issn.1001-9081.2020020167

• 网络空间安全 • 上一篇    下一篇

基于随机函数的非线性映射保序加密方案

徐衍胜1, 张游杰2   

  1. 1. 山西军跃迈科信息安全技术有限公司, 太原 030006;
    2. 太原鹏跃电子科技有限公司, 太原 030032
  • 收稿日期:2020-02-21 修回日期:2020-05-17 出版日期:2020-10-10 发布日期:2020-05-21
  • 通讯作者: 张游杰
  • 作者简介:徐衍胜(1975-),男,山东济宁人,工程师,硕士,主要研究方向:计算机信息系统软件、信息系统集成、信息系统实施与应用;张游杰(1973-),男,山西交城人,研究员级高级工程师,CCF会员,主要研究方向:计算机信息系统软件、信息系统集成、网络空间安全。

Order preserving encryption scheme of nonlinear mapping based on random function

XU Yansheng1, ZHANG Youjie2   

  1. 1. Shanxi JunyueMaike Information Security Technology Company Limited, Taiyuan Shanxi 030006, China;
    2. Taiyuan Pengyue Electronic Technology Company Limited, Taiyuan Shanxi 030032, China
  • Received:2020-02-21 Revised:2020-05-17 Online:2020-10-10 Published:2020-05-21

摘要: 针对现有保序加密方案在安全性、高效性和易用性方面难以兼顾的问题,提出一种基于随机函数的非线性映射保序加密方案。该方案将明文空间看作一个等差递增数列,基于密钥将数列中每一个元素都映射到一个单独的密文空间。该密钥通过一个非均匀分布的随机数发生函数来生成,而密文空间的构造利用计算机程序来实现。在加密时,只需从对应的密文空间中随机选取一个值即可作为其密文。分析和实验结果表明,所提方案达到了等序明文不可区分(IND-OCPA)安全,并能有效防止统计攻击;其每十万个数据的平均加密时间为30 ms~50 ms,加密效率较高;该方案不需要复杂的参数预设,且可以采用任何计算机语言实现,具有良好的易用性。

关键词: 保序加密, 非线性映射, 随机函数, 统计攻击, IND-OCPA安全

Abstract: To solve the problem that the existing order preserving encryption schemes are difficult to give consideration to security, efficiency and ease of use at the same time, an order preserving encryption scheme of non-linear mapping based on random function was proposed. In the scheme, the plaintext space was considered as an increasing arithmetic sequence, and each element of the sequence was mapped to a separate ciphertext space based on the key. The key was generated by a random number generating function with non-uniform distribution, and the ciphertext space was constructed by a computer program. During encrypting, the value randomly selected from the corresponding ciphertext space was able to be used as the ciphertext. Analysis and experimental results show that the proposed scheme achieves INDistinguishability under Ordered Chosen Plaintext Attack (IND-OCPA) safety and can effectively prevent statistical attacks; it has the average encryption time per 100 000 data of from 30 ms to 50 ms, resulting in high encryption efficiency; the complex parameter presets are not required in the scheme, and the scheme can be implemented in any computer language, so that it is easy to use.

Key words: order preserving encryption, nonlinear mapping, random function, statistical attack, INDistinguishability under Ordered Chosen Plaintext Attack (IND-OCPA) safety

中图分类号: