A general and efficient redactable blockchain scheme based on voting committee

Abstract In recent years, blockchain technologies have attracted widespread attention and research in academia and industry. The immutable characteristic of a blockchain guarantees the reliability of data on the blockchain, but the characteristic also leads to the consequence that the harmful or erroneous or privacy data of blockchain cannot be redacted. For the purpose of eliminating harmful data, protecting privacy, updating erroneous data, etc., it is necessary to delete and update the data on blockchains in a safe and controlled way. In this paper, we propose a general and efficient redactable blockchain scheme based on the voting committee selection. Our scheme achieves controllable redactions because a redaction request can be executed only when enough committee members agree to the request. We use a distributed key generation scheme and a threshold signature scheme to significantly decrease the redaction proof size, which results in small running overheads. Our scheme is compatible with various consensus mechanisms and network environments, supports publicly verifiability and fast redactions, and has a good scalability. We also formally prove that our scheme satisfies the necessary security properties. Finally, we develop a proof-of-concept implementation for our scheme, and the experiment results show that the scheme is efficient and practical.

Authors

Institutions

Publication Details

Journal
The Computer Journal
Published
2026-02-21
DOI
https://doi.org/10.1093/comjnl/bxag024
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A general and efficient redactable blockchain scheme based on voting committee

Lu Yin, Yi Liu, Jianfeng Shi, Yuwen Zhang
The Computer Journal
Blockchain Technology Applications and Security
article

A general and efficient redactable blockchain scheme based on voting committee

Lu Yin, Yi Liu, Jianfeng Shi, Yuwen Zhang
article en

Abstract

Abstract In recent years, blockchain technologies have attracted widespread attention and research in academia and industry. The immutable characteristic of a blockchain guarantees the reliability of data on the blockchain, but the characteristic also leads to the consequence that the harmful or erroneous or privacy data of blockchain cannot be redacted. For the purpose of eliminating harmful data, protecting privacy, updating erroneous data, etc., it is necessary to delete and update the data on blockchains in a safe and controlled way. In this paper, we propose a general and efficient redactable blockchain scheme based on the voting committee selection. Our scheme achieves controllable redactions because a redaction request can be executed only when enough committee members agree to the request. We use a distributed key generation scheme and a threshold signature scheme to significantly decrease the redaction proof size, which results in small running overheads. Our scheme is compatible with various consensus mechanisms and network environments, supports publicly verifiability and fast redactions, and has a good scalability. We also formally prove that our scheme satisfies the necessary security properties. Finally, we develop a proof-of-concept implementation for our scheme, and the experiment results show that the scheme is efficient and practical.

The Computer Journal
China Academy of Information and Communications Technology (CN)
Openalex Percentile: Top 22%
Blockchain Technology Applications and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.