FMR-PDP: Flexible multiple-replica provable data possession in cloud storage

Limin Li, Yahui Yang, Zhonghai Wu
{"title":"FMR-PDP: Flexible multiple-replica provable data possession in cloud storage","authors":"Limin Li, Yahui Yang, Zhonghai Wu","doi":"10.1109/ISCC.2017.8024675","DOIUrl":null,"url":null,"abstract":"Cloud storage is a service provided by cloud service provider (CSP). More and more individuals and organizations accept the scheme and outsource their data to CSP seeking to reduce local storage burden. Since the outsourced files are no longer under the data owners' direct control and CSP is not trustworthy, it is necessary for data owners to check the integrity of their files outsourced to CSP. To address this crucial problem, some provable data possession (PDP) protocols have been presented. In order to obtain higher availability, storing multiple replicas is a common strategy in cloud storage. Most recent researches on multiple-replica provable data possession (MR-PDP) use homomorphic linear authenticators (HLAs) to generate aggregated tags for the blocks at the same indices in each replica, but it cannot verify single replica to identify the corrupted replicas. In this paper, we proposed a novel multiple replica provable data possession scheme, named FMR-PDP. In FMR-PDP, we compute tags based on vector dot product instead of expensive group exponentiation operations, and only generate one tag for all blocks at the same indices in each replica. Our FMR-PDP scheme supports a flexible data possession verification, which means the data owner can check any number of replicas in a verification. In addition, we make a comprehensive performance analysis, which shows that our proposed scheme is flexible and efficient.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2017.8024675","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Cloud storage is a service provided by cloud service provider (CSP). More and more individuals and organizations accept the scheme and outsource their data to CSP seeking to reduce local storage burden. Since the outsourced files are no longer under the data owners' direct control and CSP is not trustworthy, it is necessary for data owners to check the integrity of their files outsourced to CSP. To address this crucial problem, some provable data possession (PDP) protocols have been presented. In order to obtain higher availability, storing multiple replicas is a common strategy in cloud storage. Most recent researches on multiple-replica provable data possession (MR-PDP) use homomorphic linear authenticators (HLAs) to generate aggregated tags for the blocks at the same indices in each replica, but it cannot verify single replica to identify the corrupted replicas. In this paper, we proposed a novel multiple replica provable data possession scheme, named FMR-PDP. In FMR-PDP, we compute tags based on vector dot product instead of expensive group exponentiation operations, and only generate one tag for all blocks at the same indices in each replica. Our FMR-PDP scheme supports a flexible data possession verification, which means the data owner can check any number of replicas in a verification. In addition, we make a comprehensive performance analysis, which shows that our proposed scheme is flexible and efficient.
FMR-PDP:云存储中灵活的多副本可证明的数据占有
云存储是云服务提供商(CSP)提供的一种服务。越来越多的个人和组织接受这种方案,并将他们的数据外包给CSP,以减少本地存储负担。由于外判文件已不再受资料拥有人的直接控制,而CSP又不值得信任,因此资料拥有人有必要检查外判给CSP的文件的完整性。为了解决这个关键问题,已经提出了一些可证明的数据占有(PDP)协议。为了获得更高的可用性,存储多个副本是云存储中的常用策略。最近的多副本可证明数据占有(MR-PDP)研究大多使用同态线性身份验证器(HLAs)为每个副本中相同索引处的块生成聚合标签,但它不能验证单个副本以识别损坏的副本。本文提出了一种新的多副本可证明数据占有方案——FMR-PDP。在FMR-PDP中,我们基于向量点积而不是昂贵的群幂运算来计算标签,并且每个副本中相同索引处的所有块仅生成一个标签。我们的FMR-PDP方案支持灵活的数据占有验证,这意味着数据所有者可以在验证中检查任意数量的副本。此外,我们还进行了全面的性能分析,表明我们提出的方案是灵活和高效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信