检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:任艳丽[1] 徐丹婷 张新鹏[1] 谷大武[2] REN Yanli;XU Danting;ZHANG Xinpeng;GU Dawu(School of Communication and Information Engineering,Shanghai University,Shanghai 200444,China;School of Electronic Information and Electrical Engineering,Shanghai Jiaotong University,Shanghai 200240,China)
机构地区:[1]上海大学通信与信息工程学院,上海200444 [2]上海交通大学电子信息与电气工程学院,上海200240
出 处:《通信学报》2019年第4期71-82,共12页Journal on Communications
基 金:国家自然科学基金资助项目(No.U1736120;No.61572309;No.61525203;No.U1636206)~~
摘 要:随着区块链的发展,存储所有区块数据需要巨大的存储空间,而数据一旦写入链中就不能更改,可能会造成过期数据占用大量存储空间的问题。首先对门限环签名方案进行改进,然后基于空间证明的共识机制提出了可删除的区块链。当某个区块数据过期或失效时,经大多数节点同意并签名后,可对该区块进行有效删除,并保持区块链的总体结构不变。在模拟环境中进行了仿真实验,结果表明,所提区块链方案在生成和删除区块时效率都很高,且不影响其他区块的存储和使用。With the development of blockchain, huge storage space is needed to store all of blockchain data. In addition, data can’t be changed once it is packaged into the chain, and it may be possible for overdue data to take up large storage space. Firstly, a threshold ring signature scheme was improved, and then a deletable blockchain scheme based on the mechanism of proof of space (PoSpace) consensus was constructed. Most of nodes could sign and delete a block together when block data was overdue, and the overall structure of the blockchain was unchanged. Several experiments in a simulated environment were executed, and the results show that the proposed blockchain scheme has high efficiency in generating and delegating a block. Meanwhile, the deletion of a block doesn’t influence the storage and use of other blocks.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49