FM-DPDP:具有灵活存储的细粒度多拷贝动态可证明数据占有

IF 3.7 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Caiyuan Tang , Feng Wang , Chenbin Zhao , Hui Cui , Zuobin Ying , Ching-Chun Chang , Chin-Chen Chang
{"title":"FM-DPDP:具有灵活存储的细粒度多拷贝动态可证明数据占有","authors":"Caiyuan Tang ,&nbsp;Feng Wang ,&nbsp;Chenbin Zhao ,&nbsp;Hui Cui ,&nbsp;Zuobin Ying ,&nbsp;Ching-Chun Chang ,&nbsp;Chin-Chen Chang","doi":"10.1016/j.jisa.2025.104262","DOIUrl":null,"url":null,"abstract":"<div><div>In recent years, the widespread adoption of cloud storage has surged alongside the rapid and exponential increase in data. However, cloud storage also brings an integrity threat with remote data. Consequently, many schemes have been proposed to safeguard remote data integrity. In these researches, multicopy Provable data possession (PDP) is an effective method for enhancing data security. Unfortunately, most existing schemes only support integer multiples of copies, which may reduce the practicality of these schemes. In this paper, we use the Ternary Copy Hash Tree (TCHT) as a dynamic structure to propose a Fine-grained Multicopy Dynamic Provable Data Possession (FM-DPDP) scheme. Unlike traditional multicopy PDP, which only supports an integer number of copies, FM-DPDP supports fine-grained replication. This means that the number of replicas can be any rational number greater than 1. Furthermore, The FM-DPDP also supports, data restoration, privacy preservation and data dynamics. The security analysis demonstrates that the proposed scheme is correct and unforgeability. Besides, we compare FM-DPDP with other relevant schemes. The evaluation indicates that our scheme offers additional functionalities while maintaining comparable computational cost and communication efficiency to other schemes.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"95 ","pages":"Article 104262"},"PeriodicalIF":3.7000,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FM-DPDP: Fine-grained Multicopy Dynamic Provable Data Possession with flexible storage\",\"authors\":\"Caiyuan Tang ,&nbsp;Feng Wang ,&nbsp;Chenbin Zhao ,&nbsp;Hui Cui ,&nbsp;Zuobin Ying ,&nbsp;Ching-Chun Chang ,&nbsp;Chin-Chen Chang\",\"doi\":\"10.1016/j.jisa.2025.104262\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In recent years, the widespread adoption of cloud storage has surged alongside the rapid and exponential increase in data. However, cloud storage also brings an integrity threat with remote data. Consequently, many schemes have been proposed to safeguard remote data integrity. In these researches, multicopy Provable data possession (PDP) is an effective method for enhancing data security. Unfortunately, most existing schemes only support integer multiples of copies, which may reduce the practicality of these schemes. In this paper, we use the Ternary Copy Hash Tree (TCHT) as a dynamic structure to propose a Fine-grained Multicopy Dynamic Provable Data Possession (FM-DPDP) scheme. Unlike traditional multicopy PDP, which only supports an integer number of copies, FM-DPDP supports fine-grained replication. This means that the number of replicas can be any rational number greater than 1. Furthermore, The FM-DPDP also supports, data restoration, privacy preservation and data dynamics. The security analysis demonstrates that the proposed scheme is correct and unforgeability. Besides, we compare FM-DPDP with other relevant schemes. The evaluation indicates that our scheme offers additional functionalities while maintaining comparable computational cost and communication efficiency to other schemes.</div></div>\",\"PeriodicalId\":48638,\"journal\":{\"name\":\"Journal of Information Security and Applications\",\"volume\":\"95 \",\"pages\":\"Article 104262\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Security and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2214212625002996\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625002996","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,随着数据的快速增长,云存储的广泛采用也在激增。然而,云存储也带来了远程数据的完整性威胁。因此,人们提出了许多保护远程数据完整性的方案。在这些研究中,多副本可证明数据占有(PDP)是提高数据安全性的有效方法。不幸的是,大多数现有的模式只支持整数倍的副本,这可能会降低这些模式的实用性。本文采用三元复制哈希树(TCHT)作为动态结构,提出了一种细粒度多拷贝动态可证明数据占有(FM-DPDP)方案。与传统的多副本PDP不同,FM-DPDP支持细粒度的复制。这意味着副本的数量可以是大于1的任何有理数。此外,FM-DPDP还支持数据恢复、隐私保护和数据动态。安全性分析证明了该方案的正确性和不可伪造性。此外,我们还将FM-DPDP与其他相关方案进行了比较。评估表明,我们的方案提供了额外的功能,同时保持了与其他方案相当的计算成本和通信效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FM-DPDP: Fine-grained Multicopy Dynamic Provable Data Possession with flexible storage
In recent years, the widespread adoption of cloud storage has surged alongside the rapid and exponential increase in data. However, cloud storage also brings an integrity threat with remote data. Consequently, many schemes have been proposed to safeguard remote data integrity. In these researches, multicopy Provable data possession (PDP) is an effective method for enhancing data security. Unfortunately, most existing schemes only support integer multiples of copies, which may reduce the practicality of these schemes. In this paper, we use the Ternary Copy Hash Tree (TCHT) as a dynamic structure to propose a Fine-grained Multicopy Dynamic Provable Data Possession (FM-DPDP) scheme. Unlike traditional multicopy PDP, which only supports an integer number of copies, FM-DPDP supports fine-grained replication. This means that the number of replicas can be any rational number greater than 1. Furthermore, The FM-DPDP also supports, data restoration, privacy preservation and data dynamics. The security analysis demonstrates that the proposed scheme is correct and unforgeability. Besides, we compare FM-DPDP with other relevant schemes. The evaluation indicates that our scheme offers additional functionalities while maintaining comparable computational cost and communication efficiency to other schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信