A Scheme for Verifying the Integrity of Outsourced Data  

A Scheme for Verifying the Integrity of Outsourced Data

在线阅读下载全文

作  者:WANG Xiaoming YU Fang LIN Yanchun GAN Qingqing WU Daini 

机构地区:[1]Department of Computer Science,Jinan University

出  处:《China Communications》2015年第11期188-195,共8页中国通信(英文版)

基  金:supported in part by National Natural Science Foundation of China under Grant (61070164,61272415);Natural Science Foundation of Guangdong Province, China under Grant (S2012010008767);Science and Technology Planning Project of Guangdong Province, China under Grant (2013B010401015)

摘  要:Unauthorized tampering with outsourced data can result in significant losses for both data owner and users.Data integrity therefore becomes an important factor in outsourced data systems.In this paper,we address this problem and propose a scheme for verifying the integrity of outsourced data.We first propose a new authenticated data structure for authenticating membership queries in sets based on accumulators,and then show how to apply it to the problem of verifying the integrity of outsourced data.We also prove that our scheme is secure under the q-strong DiffieHellman assumption.More importantly,our scheme has the constant cost communication,meanwhile keeping other complexity measures constant.Compared to previous schemes based on accumulators,our scheme reduces update cost and so improves previous schemes based on accumulators.In addition,the experimental comparison shows that our scheme outperforms the previous schemes.Unauthorized tampering with outsourced data can result in significant losses for both data owner and users. Data integrity therefore becomes an important factor in outsourced data systems. In this paper, we address this problem and propose a scheme for verifying the integrity of outsourced data. We first propose a new authenticated data structure for authenticating membership queries in sets based on accumulators, and then show how to apply it to the problem of verifying the integrity of outsourced data. We also prove that our scheme is secure under the q-strong Diffie-Hellman assumption. More importantly, our scheme has the constant cost communication, meanwhile keeping other complexity measures constant. Compared to previous schemes based on accumulators, our scheme reduces update cost and so improves previous schemes based on accumulators. In addition, the experimental comparison shows that our scheme outperforms the previous schemes.

关 键 词:outsourced DATA authenticated datastructure DATA INTEGRITY CONSTANT COMPLEXITY 

分 类 号:TP309[自动化与计算机技术—计算机系统结构]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象