基于智能合约的可仲裁多副本数据审计方案

Junfeng Tian, Qian Yang
{"title":"基于智能合约的可仲裁多副本数据审计方案","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":"{\"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}","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

摘要

为了提高数据的可用性和持久性,轻量级云用户希望在服务器上存储原始文件的多个副本,以减少本地计算和存储开销。同时,为了保证远程存储数据的完整性,设计了一些允许公众验证的方案。然而,大多数现有方案只关注恶意云服务提供商,而忽略了不诚实用户为利润而作弊的可能性。本文实现了一种多副本存储下的可仲裁数据审计方案。该方案采用多副本存储下的新型仲裁机制,利用智能合约的不可篡改特性,通过矿工进行可靠验证,实现对任何欺诈实体的及时发现和处罚。此外,该方案还设计了基于B*树的多副本存储模型,实现了副本块的批量验证,能够在数据更新后识别恶意用户的欺诈行为,提高了空间利用效率。文章还对所提出的方案进行了详细的安全性证明。评估结果表明,我们的方案不仅实现了一个更实用、更公平的审计方案,而且比当前最先进的多副本可仲裁方案具有更低的计算开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An arbitrable multi‐replica data auditing scheme based on smart contracts
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信