一种新的高效的基于请求的比较加密方案的.pdfVIP

一种新的高效的基于请求的比较加密方案 1 1 2 陈鹏 ，叶俊 ，陈晓峰 1 西安电子科技大学通信工程学院，西安　710071 2 综合业务网理论及关键技术国家重点实验室，西安电子科技大学，西安　710071 摘要：数据库中的加密数字比较是学术研究中的热点。尽管保序加密 (OPE) 可以达到这个目 标，但是当一个范围内的所有数都用 OPE 来加密时，攻击者可以从数字顺序中获得原始数字 信息。Furukawa 提出了称为基于请求的比较加密的新型数字加密方法，但它的缺点在于效率 不高。本文基于比较加密使用滑动窗口法提出了一种新的加密模式，在存储和计算负载方面都 由于原来的比较加密。在我们的方案中，用户可以根据自己的实际情况调节窗口大小来达到安 全和效率的折衷。 关键词：比较加密；滑动窗口；安全；效率 中图分类号：TP309 A New Efficient Request-Based Comparable Encryption Scheme 1 1 2 CHEN Peng , YE Jun , CHEN Xiao-Feng 1 School of Telecommunications Engineering, Xidian University, Xi’an 710071 2 State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi’an 710071 Abstract: Privacy-preserving comparisons over encrypted entries of a database is a hot topic in academic research. Although order preserving encryption (OPE) basically achieves this target, when all the numbers in a certain scope are encrypted by an OPE, an attacker can retrieve the original numbers from their order. Furukawa puts forth a novel digit number encryption method called request-based comparable encryption (comparable encryption for short). but the disadvantages is that the token and cipher generations are inefficient. In this paper, we propose a new scheme based on comparable encryption by using sliding window method, which performs better than original comparable encryption both in storage and in computation workload. In our scheme, the users can obtain a trade-off between security and efficiency through adaptively setting the window size according to their real scenario. Key words: Comparable Encryption, Sliding Window, Security, Efficiency. Foundations: Doctoral Fund of Ministry of Ed