Redactable Blockchain from Accountable Weight Threshold Chameleon Hash

IF 3 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Qiang Ma , Yanqi Zhao , Xiangyu Liu , Xiaoyi Yang , Min Xie , Yong Yu
{"title":"Redactable Blockchain from Accountable Weight Threshold Chameleon Hash","authors":"Qiang Ma ,&nbsp;Yanqi Zhao ,&nbsp;Xiangyu Liu ,&nbsp;Xiaoyi Yang ,&nbsp;Min Xie ,&nbsp;Yong Yu","doi":"10.1016/j.hcc.2024.100281","DOIUrl":null,"url":null,"abstract":"<div><div>The redactable blockchain provides the editability of blocks, which guarantees the data immutability of blocks while removing illegal content on the blockchain. However, the existing redactable blockchain relies on trusted assumptions regarding a single editing authority. Ateniese et al. (EuroS&amp;P 2017) and Li et al. (TIFS 2023) proposed solutions by using threshold chameleon hash functions, but these lack accountability for malicious editing. This paper delves into this problem and proposes an accountability weight threshold blockchain editing scheme. Specifically, we first formalize the model of a redactable blockchain with accountability. Then, we introduce the novel concept of the Accountable Weight Threshold Chameleon Hash Function (AWTCH). This function collaboratively generates a chameleon hash trapdoor through a weight committee protocol, where only sets of committees meeting the weight threshold can edit data. Additionally, it incorporates a tracer to identify and hold accountable any disputing editors, thus enabling supervision of editing rights. We propose a generic construction for AWTCH. Then, we introduce an efficient construction of AWTCH and develop a redactable blockchain scheme by leveraging AWTCH. Finally, we demonstrate our scheme’s practicality. The editing efficiency of our scheme is twice that of Tian et al. (TIFS 2023) with the same number of editing blocks.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 3","pages":"Article 100281"},"PeriodicalIF":3.0000,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"High-Confidence Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667295224000849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The redactable blockchain provides the editability of blocks, which guarantees the data immutability of blocks while removing illegal content on the blockchain. However, the existing redactable blockchain relies on trusted assumptions regarding a single editing authority. Ateniese et al. (EuroS&P 2017) and Li et al. (TIFS 2023) proposed solutions by using threshold chameleon hash functions, but these lack accountability for malicious editing. This paper delves into this problem and proposes an accountability weight threshold blockchain editing scheme. Specifically, we first formalize the model of a redactable blockchain with accountability. Then, we introduce the novel concept of the Accountable Weight Threshold Chameleon Hash Function (AWTCH). This function collaboratively generates a chameleon hash trapdoor through a weight committee protocol, where only sets of committees meeting the weight threshold can edit data. Additionally, it incorporates a tracer to identify and hold accountable any disputing editors, thus enabling supervision of editing rights. We propose a generic construction for AWTCH. Then, we introduce an efficient construction of AWTCH and develop a redactable blockchain scheme by leveraging AWTCH. Finally, we demonstrate our scheme’s practicality. The editing efficiency of our scheme is twice that of Tian et al. (TIFS 2023) with the same number of editing blocks.
可读的区块链从可问责权重阈值变色龙哈希
可读区块链提供了块的可编辑性,这保证了块的数据不变性,同时删除了区块链上的非法内容。但是,现有的可读区块链依赖于关于单个编辑权限的可信假设。Ateniese等人(EuroS&P 2017)和Li等人(TIFS 2023)通过使用阈值变色龙哈希函数提出了解决方案,但这些方法缺乏对恶意编辑的问责制。本文对这一问题进行了深入研究,提出了一种问责权值区块链编辑方案。具体地说,我们首先形式化了具有问责性的可读区块链模型。然后,我们引入了可问责权值变色龙哈希函数(AWTCH)的新概念。该函数通过权重委员会协议协作生成一个变色龙散列陷阱门,只有满足权重阈值的委员会集才能编辑数据。此外,它还包含一个追踪器来识别和追究任何有争议的编辑的责任,从而实现对编辑权利的监督。我们提出了一个通用的awwatch结构。然后,我们介绍了一种有效的AWTCH结构,并利用AWTCH开发了一个可读区块链方案。最后,验证了方案的实用性。我们方案的编辑效率是Tian等人(TIFS 2023)在相同数量的编辑块情况下的两倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.70
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信