Public Integrity Verification for Cloud Storage with Efficient Key-update

Hao Yan Hao Yan, Yanan Liu Hao Yan, Dandan Huang Yanan Liu, Shuo Qiu Dandan Huang, Zheng Zhang Shuo Qiu
{"title":"Public Integrity Verification for Cloud Storage with Efficient Key-update","authors":"Hao Yan Hao Yan, Yanan Liu Hao Yan, Dandan Huang Yanan Liu, Shuo Qiu Dandan Huang, Zheng Zhang Shuo Qiu","doi":"10.53106/160792642023112406009","DOIUrl":null,"url":null,"abstract":"To improve the security of the data on cloud storage, numbers of data integrity auditing schemes have been proposed in the past several years. However, there only a few schemes considered the security challenge that the user’s key is exposed unknowingly which is very likely to happen in real-life. To cope with the problem, we propose a public data integrity auditing scheme for cloud storage with efficient key updating. In our scheme, the user’s key is updated periodically to resist the risk of key exposure. Meanwhile, the authentication tags of blocks are updated simultaneously with the key updating so as to guarantee the data integrity can be verified normally. The algorithm of key updating in our scheme is very efficient which only needs a hash operation while previous schemes need two or three exponentiation operations. Moreover, the workload of tag updating is undertaken by cloud servers with a re-tag-key which reduces the burden of users and improves the efficiency of the scheme. The communication cost of the scheme is also reduced greatly, for instance, the information size in ‘re-key’ step is decreased from two group members to one. Furthermore, we give the formal security model of our scheme and prove the security under the CDH assumption. The experimental results show that our proposal is efficient and feasible.","PeriodicalId":442331,"journal":{"name":"網際網路技術學刊","volume":"27 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"網際網路技術學刊","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53106/160792642023112406009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To improve the security of the data on cloud storage, numbers of data integrity auditing schemes have been proposed in the past several years. However, there only a few schemes considered the security challenge that the user’s key is exposed unknowingly which is very likely to happen in real-life. To cope with the problem, we propose a public data integrity auditing scheme for cloud storage with efficient key updating. In our scheme, the user’s key is updated periodically to resist the risk of key exposure. Meanwhile, the authentication tags of blocks are updated simultaneously with the key updating so as to guarantee the data integrity can be verified normally. The algorithm of key updating in our scheme is very efficient which only needs a hash operation while previous schemes need two or three exponentiation operations. Moreover, the workload of tag updating is undertaken by cloud servers with a re-tag-key which reduces the burden of users and improves the efficiency of the scheme. The communication cost of the scheme is also reduced greatly, for instance, the information size in ‘re-key’ step is decreased from two group members to one. Furthermore, we give the formal security model of our scheme and prove the security under the CDH assumption. The experimental results show that our proposal is efficient and feasible.
利用高效密钥更新实现云存储的公共完整性验证
为了提高云存储数据的安全性,过去几年中提出了许多数据完整性审计方案。然而,只有少数方案考虑到了现实生活中很可能发生的用户密钥在不知情的情况下暴露的安全挑战。为了解决这个问题,我们提出了一种高效密钥更新的云存储公共数据完整性审计方案。在我们的方案中,用户的密钥会定期更新,以抵御密钥暴露的风险。同时,在密钥更新的同时,区块的认证标签也会同步更新,以保证数据的完整性能得到正常验证。我们方案中的密钥更新算法非常高效,只需要一次哈希运算,而之前的方案需要两到三次指数运算。此外,标签更新的工作量由云服务器承担,只需重新设置标签密钥,减轻了用户的负担,提高了方案的效率。该方案的通信成本也大大降低,例如,"重配密钥 "步骤的信息量从两名组员减少到一名。此外,我们还给出了方案的正式安全模型,并证明了 CDH 假设下的安全性。实验结果表明,我们的方案是高效可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信