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

全委托的公共可验证的外包数据库方案
引用本文:周搏洋,陈春雨,王强,周福才. 全委托的公共可验证的外包数据库方案[J]. 软件学报, 2021, 32(12): 3901-3916
作者姓名:周搏洋  陈春雨  王强  周福才
作者单位:东北大学 软件学院,辽宁 沈阳 110169;中国科学院 沈阳自动化研究所,辽宁 沈阳 110016
基金项目:国家自然科学基金(61872069);中央高校基本科研业务费专项基金(N171704005)
摘    要:为解决可验证外包数据库方案存在的预处理阶段开销较大及不支持公共可验证的问题,提出了一个全委托的公共可验证的外包数据库模型.给出了模型的架构及交互流程,对模型进行了形式化定义,并给出了模型的正确性定义和安全性定义.利用双线性映射及可验证外包模幂运算协议,构建了一个全委托的公共可验证外包数据库方案,且给出了各个算法的详细描述,证明了方案的正确性和安全性.其安全性可规约为BDHE (bilinear diffie-hellman exponent)难题.与现有方案及不进行全委托计算的方案相比,全委托的公共可验证的外包数据库方案基于可验证外包模幂运算,将大量模幂运算外包给云处理,减小了数据拥有者的开销.理论与实验分析表明:该方案数据拥有者在预处理阶段所需的代价更低,效率更高,适于实际应用.此外,验证过程无需私钥参与,实现了公共可验证.

关 键 词:可验证数据库  可验证计算  公共可验证  全委托  双线性映射
收稿时间:2020-04-11
修稿时间:2020-05-24

Publicly Verifiable Outsourced Database with Full Delegations
ZHOU Bo-Yang,CHEN Chun-Yu,WANG Qiang,ZHOU Fu-Cai. Publicly Verifiable Outsourced Database with Full Delegations[J]. Journal of Software, 2021, 32(12): 3901-3916
Authors:ZHOU Bo-Yang  CHEN Chun-Yu  WANG Qiang  ZHOU Fu-Cai
Affiliation:Software College, Northeastern University, Shenyang 110169, China;Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
Abstract:To solve the problem of high preprocessing cost and public verifiability in the verifiable outsourced database schemes, a publicly verifiable outsourced database with full delegation is proposed. The architecture and the definition of security and correctness of the model are present. Based on the bilinear map and verifiable outsourced modular exponentiations protocol, a publicly verifiable outsourced database scheme with full delegation is constructed, and each algorithm is designed in detail. The rigorous security proof is presented under the bilinear Diffie-Hellman exponent (BDHE) problem. Compared with performing the protocol without full delegation scheme and the existing schemes, the data owner in publicly verifiable outsourced database with full delegations scheme outsources more operations to the cloud because of the application of the verifiable outsourced modular exponentiation operation. The theoretical analysis and simulation confirm that the cost of the proposed scheme is lower in the preprocessing phase, which makes it more efficient and practical. In the verification phase, any user can verify the result since the verification algorithm does not take any secret key as input. Therefore, the proposed scheme achieves public verifiability.
Keywords:verifiable database  verifiable computing  public verification  full delegation  bilinear pairing
本文献已被 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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