{"title":"An arbitrable multi‐replica data auditing scheme based on smart contracts","authors":"Junfeng Tian, Qian Yang","doi":"10.1002/cpe.7164","DOIUrl":null,"url":null,"abstract":"In order to improve the availability and persistence of data, lightweight cloud users want to store multiple‐replicas of the original file on the server with less local computing and storage overhead. Meanwhile, to ensure the integrity of the remote storage data, some schemes have been designed to allow public verification. However, most existing schemes only focus on malicious cloud service providers and ignore the possibility that dishonest users cheat for profit. This article implements an arbitrable data auditing scheme under multi‐replica storage. The scheme adopts a new arbitration mechanism under multi‐replica storage, makes use of the non‐tampering characteristics of smart contracts, carries out reliable verification through miners, and realizes the timely detection and punishment of any fraudulent entity. In addition, the scheme also designs a multi‐replica storage model based on the B* tree, realizes the batch verification of replica blocks, enables the fraud behavior of malicious users to be identified after data update, and improves the space utilization efficiency. The article also gives detailed security proof of the proposed scheme. The evaluation result shows our scheme not only realizes a more practical and fairer audit scheme but also has lower computational overhead than current state‐of‐the‐art multi‐replica arbitrable schemes.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In order to improve the availability and persistence of data, lightweight cloud users want to store multiple‐replicas of the original file on the server with less local computing and storage overhead. Meanwhile, to ensure the integrity of the remote storage data, some schemes have been designed to allow public verification. However, most existing schemes only focus on malicious cloud service providers and ignore the possibility that dishonest users cheat for profit. This article implements an arbitrable data auditing scheme under multi‐replica storage. The scheme adopts a new arbitration mechanism under multi‐replica storage, makes use of the non‐tampering characteristics of smart contracts, carries out reliable verification through miners, and realizes the timely detection and punishment of any fraudulent entity. In addition, the scheme also designs a multi‐replica storage model based on the B* tree, realizes the batch verification of replica blocks, enables the fraud behavior of malicious users to be identified after data update, and improves the space utilization efficiency. The article also gives detailed security proof of the proposed scheme. The evaluation result shows our scheme not only realizes a more practical and fairer audit scheme but also has lower computational overhead than current state‐of‐the‐art multi‐replica arbitrable schemes.