首页 | 本学科首页   官方微博 | 高级检索  
     

基于字符串排序的高效保密数据库查询
引用本文:李顺东,亢佳,杨晓艺,窦家维.基于字符串排序的高效保密数据库查询[J].软件学报,2018,29(7):1893-1908.
作者姓名:李顺东  亢佳  杨晓艺  窦家维
作者单位:陕西师范大学 计算机科学学院, 陕西 西安 710062,陕西师范大学 计算机科学学院, 陕西 西安 710062,陕西师范大学 计算机科学学院, 陕西 西安 710062,陕西师范大学 数学与信息科学学院, 陕西 西安 710062
基金项目:国家自然科学基金(61272435)
摘    要:安全多方计算是近年来国际密码学界研究的热点问题之一,是信息社会隐私保护的核心技术.保密地将字符串按照字典序排序问题是一个全新的安全多方计算问题,在信息安全领域有重要的实际意义和广泛的应用前景.它不仅可以提高保密数据库查询的效率,还可以解决大数据情况下的百万富翁问题.为了保密地判断两个字符串按照字典序排序的位置关系,本文首先设计了一种新的编码方法和一种基于ElGamal加密算法的云外包计算下的同态加密方案,在此基础上提出了一个高效,简单的协议,并对协议做了正确性和安全性分析,同时给出了协议计算复杂性和通信复杂性的理论分析与实验验证.最后将保密的字符串排序问题的协议应用于解决百万富翁问题,从根本上解决了大数据情况下的百万富翁问题.

关 键 词:密码学  安全多方计算  字符串排序  数据库保密查询  同态加密  百万富翁问题
收稿时间:2017/5/29 0:00:00
修稿时间:2017/7/13 0:00:00

String Sorting Based Efficient Secure Database Query
LI Shun-Dong,KANG Ji,YANG Xiao-Yi and DOU Jia-Wei.String Sorting Based Efficient Secure Database Query[J].Journal of Software,2018,29(7):1893-1908.
Authors:LI Shun-Dong  KANG Ji  YANG Xiao-Yi and DOU Jia-Wei
Affiliation:School of Computer Science, Shaanxi Normal University, Xi''an 710062, China,School of Computer Science, Shaanxi Normal University, Xi''an 710062, China,School of Computer Science, Shaanxi Normal University, Xi''an 710062, China and School of Mathmatics and Information Science, Shaanxi Normal University, Xi''an 710062, China
Abstract:Secure multiparty computation is a research focus in the international cryptographic community and a pivotal privacy preserving technology in cyberspaces. Privacy-preserving string sorting lexicographically, as a completely new problem of secure multi-party computation, has important practical significance and broad application prospects in information security. It can not only improve the efficiency of secure database query but also solve the millionaires'' problem in the case that the numbers to be compared are very large. To privately determine the lexicographical order of two private strings, we first propose an encoding scheme to encode private numbers, then based on a homomorphic encryption algorithm supported by cloud computing outsourcing, we design a simple and efficient protocol. Furthermore, we prove that these protocols are secure in the semi-honest model, and analyze their correctness. At the same time, we also analyze the computational complexities and communication complexities of the protocol and show the efficiency of the protocol on a PC. Finally, as a fundamental solution, the scheme is applied to solve the millionaires'' problem in the case that the numbers to be compared are very large, and completely solve the problem.
Keywords:cryptography  secure multi-party computation  string sorting  secure database query  homomorphic encryption  millionaires'' problem
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号