重新审视 "在线/离线可证明数据拥有 "计划

IF 4.1 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Standards & Interfaces Pub Date : 2024-07-24 DOI:10.1016/j.csi.2024.103898

Feng Wang , Changlu Lin , Manli Yuan

{"title":"重新审视 \"在线/离线可证明数据拥有 \"计划","authors":"Feng Wang , Changlu Lin , Manli Yuan","doi":"10.1016/j.csi.2024.103898","DOIUrl":null,"url":null,"abstract":"<div><p>Wang et al. proposed the concept of “online/offline provable data possession” (OOPDP) [IEEE Transactions on Information Forensics and Security, 12(5): 1182-1194, 2017], and presented two instantiations, namely: CDH-based OOPDP and optimized OOPDP. However, in this paper we reveal that the tags in both CDH-based OOPDP and optimized OOPDP can be modified, and the optimized OOPDP is vulnerable to known one-file-tag attack. Then, we demonstrate how the (previously unrevealed) vulnerabilities can be addressed in two improved schemes, which we also show that the improved schemes incur only 61.5% of the storage space for tags on the cloud without increasing computational overhead at the user-end.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"91 ","pages":"Article 103898"},"PeriodicalIF":4.1000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Revisiting “online/offline provable data possession” schemes\",\"authors\":\"Feng Wang , Changlu Lin , Manli Yuan\",\"doi\":\"10.1016/j.csi.2024.103898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Wang et al. proposed the concept of “online/offline provable data possession” (OOPDP) [IEEE Transactions on Information Forensics and Security, 12(5): 1182-1194, 2017], and presented two instantiations, namely: CDH-based OOPDP and optimized OOPDP. However, in this paper we reveal that the tags in both CDH-based OOPDP and optimized OOPDP can be modified, and the optimized OOPDP is vulnerable to known one-file-tag attack. Then, we demonstrate how the (previously unrevealed) vulnerabilities can be addressed in two improved schemes, which we also show that the improved schemes incur only 61.5% of the storage space for tags on the cloud without increasing computational overhead at the user-end.</p></div>\",\"PeriodicalId\":50635,\"journal\":{\"name\":\"Computer Standards & Interfaces\",\"volume\":\"91 \",\"pages\":\"Article 103898\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Standards & Interfaces\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0920548924000679\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Standards & Interfaces","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0920548924000679","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

摘要

Wang 等人提出了 "在线/离线可证明数据占有"（OOPDP）的概念[IEEE Transactions on Information Forensics and Security, 12(5)：1182-1194, 2017]，并提出了两种实例，即：基于 CDH 的 OOPDP 和优化的 OOPDP：基于 CDH 的 OOPDP 和优化的 OOPDP。然而，本文揭示了基于 CDH 的 OOPDP 和优化的 OOPDP 中的标记都可以被修改，而且优化的 OOPDP 容易受到已知的单文件标记攻击。然后，我们展示了如何通过两种改进方案来解决这些（之前未披露的）漏洞，我们还展示了改进方案在不增加用户端计算开销的情况下，仅占用云上标签存储空间的 61.5%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Revisiting “online/offline provable data possession” schemes

Wang et al. proposed the concept of “online/offline provable data possession” (OOPDP) [IEEE Transactions on Information Forensics and Security, 12(5): 1182-1194, 2017], and presented two instantiations, namely: CDH-based OOPDP and optimized OOPDP. However, in this paper we reveal that the tags in both CDH-based OOPDP and optimized OOPDP can be modified, and the optimized OOPDP is vulnerable to known one-file-tag attack. Then, we demonstrate how the (previously unrevealed) vulnerabilities can be addressed in two improved schemes, which we also show that the improved schemes incur only 61.5% of the storage space for tags on the cloud without increasing computational overhead at the user-end.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computer Standards & Interfaces 工程技术-计算机：软件工程

CiteScore

11.90

自引率

16.00%

发文量

审稿时长

6 months

期刊介绍： The quality of software, well-defined interfaces (hardware and software), the process of digitalisation, and accepted standards in these fields are essential for building and exploiting complex computing, communication, multimedia and measuring systems. Standards can simplify the design and construction of individual hardware and software components and help to ensure satisfactory interworking. Computer Standards & Interfaces is an international journal dealing specifically with these topics. The journal • Provides information about activities and progress on the definition of computer standards, software quality, interfaces and methods, at national, European and international levels • Publishes critical comments on standards and standards activities • Disseminates user''s experiences and case studies in the application and exploitation of established or emerging standards, interfaces and methods • Offers a forum for discussion on actual projects, standards, interfaces and methods by recognised experts • Stimulates relevant research by providing a specialised refereed medium.