{"title":"Ascina:工业云存储系统可检索性的有效证明","authors":"Jiaqi Feng;Libing Wu;Xing Fan;Lijuan Huo;Enshu Wang;Zhuangzhuang Zhang","doi":"10.1109/TIFS.2025.3581047","DOIUrl":null,"url":null,"abstract":"Industrial cloud storage systems enhance data availability and offer intelligent services to enterprises. However, they also bring significant concerns about data integrity since the cloud space provider may not consistently retain the outsourced data. Existing cloud storage verification methods impose a significant computational burden on edge devices, so they are unsuitable for industrial cloud storage systems. Although the light-weight homomorphic authenticator somewhat alleviates the computational load on the fog node, its effectiveness remains limited and it further complicates proof generation and verification. To address these problems, we propose Ascina, a new proof of retrievability framework for industrial cloud storage systems. We employ verifiable secret sharing to delegate tag computation tasks to the computing server without disclosing the signing key. Once the fog node completes its initial configuration, no further computations are required. Additionally, we propose the improved Ascina by utilizing Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) technology to further alleviate the computational burden on the fog node. Furthermore, we propose a batch verification algorithm that simultaneously validates the integrity of multiple files while maintaining the same security assurances as single auditing. We evaluate the performance of Ascina through experiments and compare it with state-of-the-art methods. Experimental results demonstrate that the computational overhead on the fog node in Ascina is <inline-formula> <tex-math>$5\\times $ </tex-math></inline-formula>-<inline-formula> <tex-math>$251\\times $ </tex-math></inline-formula> lower than that of Edasvic and our proof verification time and proof size are reduced by <inline-formula> <tex-math>$5\\times $ </tex-math></inline-formula>-<inline-formula> <tex-math>$16\\times $ </tex-math></inline-formula> and <inline-formula> <tex-math>$977\\times $ </tex-math></inline-formula>-<inline-formula> <tex-math>$3285\\times $ </tex-math></inline-formula>, respectively. As the size and quantity of files grow, Ascina demonstrates greater efficiency in both time and space.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"6356-6370"},"PeriodicalIF":8.0000,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ascina: Efficient Proof of Retrievability for Industrial Cloud Storage Systems\",\"authors\":\"Jiaqi Feng;Libing Wu;Xing Fan;Lijuan Huo;Enshu Wang;Zhuangzhuang Zhang\",\"doi\":\"10.1109/TIFS.2025.3581047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Industrial cloud storage systems enhance data availability and offer intelligent services to enterprises. However, they also bring significant concerns about data integrity since the cloud space provider may not consistently retain the outsourced data. Existing cloud storage verification methods impose a significant computational burden on edge devices, so they are unsuitable for industrial cloud storage systems. Although the light-weight homomorphic authenticator somewhat alleviates the computational load on the fog node, its effectiveness remains limited and it further complicates proof generation and verification. To address these problems, we propose Ascina, a new proof of retrievability framework for industrial cloud storage systems. We employ verifiable secret sharing to delegate tag computation tasks to the computing server without disclosing the signing key. Once the fog node completes its initial configuration, no further computations are required. Additionally, we propose the improved Ascina by utilizing Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) technology to further alleviate the computational burden on the fog node. Furthermore, we propose a batch verification algorithm that simultaneously validates the integrity of multiple files while maintaining the same security assurances as single auditing. We evaluate the performance of Ascina through experiments and compare it with state-of-the-art methods. Experimental results demonstrate that the computational overhead on the fog node in Ascina is <inline-formula> <tex-math>$5\\\\times $ </tex-math></inline-formula>-<inline-formula> <tex-math>$251\\\\times $ </tex-math></inline-formula> lower than that of Edasvic and our proof verification time and proof size are reduced by <inline-formula> <tex-math>$5\\\\times $ </tex-math></inline-formula>-<inline-formula> <tex-math>$16\\\\times $ </tex-math></inline-formula> and <inline-formula> <tex-math>$977\\\\times $ </tex-math></inline-formula>-<inline-formula> <tex-math>$3285\\\\times $ </tex-math></inline-formula>, respectively. As the size and quantity of files grow, Ascina demonstrates greater efficiency in both time and space.\",\"PeriodicalId\":13492,\"journal\":{\"name\":\"IEEE Transactions on Information Forensics and Security\",\"volume\":\"20 \",\"pages\":\"6356-6370\"},\"PeriodicalIF\":8.0000,\"publicationDate\":\"2025-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Forensics and Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11040004/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11040004/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Ascina: Efficient Proof of Retrievability for Industrial Cloud Storage Systems
Industrial cloud storage systems enhance data availability and offer intelligent services to enterprises. However, they also bring significant concerns about data integrity since the cloud space provider may not consistently retain the outsourced data. Existing cloud storage verification methods impose a significant computational burden on edge devices, so they are unsuitable for industrial cloud storage systems. Although the light-weight homomorphic authenticator somewhat alleviates the computational load on the fog node, its effectiveness remains limited and it further complicates proof generation and verification. To address these problems, we propose Ascina, a new proof of retrievability framework for industrial cloud storage systems. We employ verifiable secret sharing to delegate tag computation tasks to the computing server without disclosing the signing key. Once the fog node completes its initial configuration, no further computations are required. Additionally, we propose the improved Ascina by utilizing Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) technology to further alleviate the computational burden on the fog node. Furthermore, we propose a batch verification algorithm that simultaneously validates the integrity of multiple files while maintaining the same security assurances as single auditing. We evaluate the performance of Ascina through experiments and compare it with state-of-the-art methods. Experimental results demonstrate that the computational overhead on the fog node in Ascina is $5\times $ -$251\times $ lower than that of Edasvic and our proof verification time and proof size are reduced by $5\times $ -$16\times $ and $977\times $ -$3285\times $ , respectively. As the size and quantity of files grow, Ascina demonstrates greater efficiency in both time and space.
期刊介绍:
The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features