Page 243 - 《软件学报》2020年第12期

软件学报 ISSN 1000-9825, CODEN RUXUEW E-mail: jos@iscas.ac.cn
Journal of Software,2020,31(12):3909−3922 [doi: 10.13328/j.cnki.jos.005894] http://www.jos.org.cn
©中国科学院软件研究所版权所有. Tel: +86-10-62562563

∗
可修改的区块链方案

1
1
1
任艳丽 , 徐丹婷 , 张新鹏 , 谷大武 2
1
(上海大学 通信与信息工程学院,上海 200444)
2 (上海交通大学 电子信息与电气工程学院,上海 200240)
通讯作者: 任艳丽, E-mail: renyanli@shu.edu.cn

摘 要: 随着区块链的迅速发展,上链数据不仅包括金融交易数据,还包括科技、文化、政治等多类数据.而在现有
的区块链系统中,数据一旦上链便无法更改,可能会面临失效数据无法删除、错误数据无法修改等问题.因此,特定条
件下可修改的区块链方案具有广阔的应用前景.在 POSpace(proof of space)共识机制下,基于陷门单向函数和新型区
块链结构,提出了可修改的区块链方案.只要超过阈值数的节点同意,便可实现区块数据的合法修改,否则不能进行
修改.除修改数据外,其余区块数据保持不变,全网节点仍可按原始验证方式对数据合法性进行验证.仿真实验表明:
只要选定合适的阈值,所提方案中,区块生成与数据修改的效率均很高,数据的修改并不改变区块之间的链接关系,
具有现实可操作性.
关键词: 区块链;可修改;陷门单向函数;空间证明;数据安全
中图法分类号: TP309

中文引用格式: 任艳丽,徐丹婷,张新鹏,谷大武.可修改的区块链方案.软件学报,2020,31(12):3909−3922. http://www.jos.org.cn/
1000-9825/5894.htm
英文引用格式: Ren YL, Xu DT, Zhang XP, Gu DW. Scheme of revisable blockchain. Ruan Jian Xue Bao/Journal of Software,
2020,31(12):3909−3922 (in Chinese). http://www.jos.org.cn/1000-9825/5894.htm

Scheme of Revisable Blockchain
1
1
1
REN Yan-Li , XU Dan-Ting , ZHANG Xin-Peng , GU Da-Wu 2
1 (School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China)
2 (School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China)
Abstract: With the rapid development of the blockchain, the data on the chain not only include financial data, but also have data of
technology, culture, politics, and so on. However, the data will not be revised once it is packaged on the existing blockchain system,
which has the problem that the invalid data cannot be deleted and the wrong data cannot be modified. Therefore, a revisable blockchain
under certain conditions has broad application prospects. Under the POSpace (proof of space) consensus mechanism, a revisable
blockchain scheme is proposed based on the trapdoor one-way function and a new blockchain structure. In this scheme, the nodes can
execute the revision operation as long as their number exceeds the threshold. Otherwise, the revision operation cannot be executed. Except
for the revised data, the remaining data on the blocks keeps unchanged, and all of the nodes on the network can still verify the validity of
data by using the original verification ways. The experiments show that block generation and data revision all have high efficiency as long
as the threshold is selected appropriately, and the link relationship between the blocks will not be changed after the data revision, and the
scheme has practical operability.

∗ 基金项目: 国家自然科学基金(U1736120, 61525203, U1636206); 上海市自然科学基金(20ZR1419700); 国家重点研发计划
(2020YFC1523004)
Foundation item: National Natural Science Foundation of China (U1736120, 61572309, 61525203, U1636206); Beijing Municipal
Natural Science Foundation (20ZR1419700); National Key Research and Development Program of China (2020YFC1523004)
收稿时间: 2019-03-15; 修改时间: 2019-09-06; 采用时间: 2019-09-27; jos 在线出版时间: 2019-12-05
CNKI 网络优先出版: 2019-12-05 14:54:55, http://kns.cnki.net/kcms/detail/11.2560.TP.20191205.1454.002.html