基于RSA累加器的区块链轻节点方案  

A Light-node Solution Based on RSA Accumulator for Blockchain

作　　者：任正伟 鲁力 李敏 邓莉[1,2] REN Zheng-wei;LU Li;LI Min;DENG Li(School of Computer Science and Technology,Wuhan University of Science and Technology,Wuhan 430065,China;Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System(Wuhan University of Science and Technology),Wuhan 430065,China)

机构地区：[1]武汉科技大学计算机科学与技术学院,湖北武汉430065 [2]智能信息处理与实时工业系统湖北省重点实验室(武汉科技大学),湖北武汉430065

出　　处：《计算机技术与发展》2025年第2期70-78,共9页Computer Technology and Development

基　　金：国家自然科学基金(61902285)。

摘　　要：在区块链系统中,随着区块的增长,节点需要存储的数据越来越多,导致一些存储空间有限的节点难以参与到区块链系统中。为此,提出了适用于区块链系统的轻节点方案,以使得轻节点只需存储区块链的部分信息就可以参与到区块链的运行中。但是,现有的一些方案中,轻节点的存储开销与区块数量仍然是线性增长关系;此外,很多方案只提供了交易的存在证明,无法为交易生成非存在证明,导致轻节点可能被欺骗。该文提出了一种基于RSA累加器的区块链轻节点方案,以使得轻节点存储的数据大小是固定的,并且能验证交易的存在性/非存在性。该方案重新设计了区块体和区块头,在区块体上,用RSA累加器组织和管理交易;在区块头上,用基于RSA累加器的累乘值替换了Merkle Root,新增了区块摘要值。之后,全节点将累乘值组织为Merkle山脉,再利用Merkle山脉和区块摘要为待验证的交易生成存在证明。当待验证的交易不在区块链上时,全节点也能根据区块头中的累乘值和RSA累加器的公共参数为其生成非存在证明。轻节点只需通过最新区块的区块摘要值以及RSA累加器的参数就能验证交易的存在性/非存在性。理论分析和仿真实验结果表明,该方案实现了预期的设计目标和安全目标,计算开销较小,存储和通信开销在合理范围内。With the growth of blockchain,blockchain nodes need to store more and more blocks,making nodes with limited storage space difficult to participate in blockchain systems.To tackle this issue,many light-node schemes have been proposed,so that light nodes can participate in the operation of a blockchain by only storing partial information of the blockchain.However,in some existing schemes,the storage overhead of light nodes still increases linearly with the number of blocks.In addition,some schemes offer only existence proofs for transactions,lacking non-existence proofs,which may deceive light nodes.We propose an RSA accumulator-based blockchain light node solution that maintains a constant data size and verifies the existence/non-existence of transactions.To this end,we re-design the block body and block header.We use RSA accumulator for transactions management within blocks,replace the Merkle Root with a multiplicative RSA-based value in block headers,and add a summary attribute.Then,the full node organizes the multiplicative values into a Merkle mountain range.The Merkle mountain range and block summary generate an existence proof for on-chain transactions,while full nodes create a non-existence proof using the block header's multiplicative value and RSA accumulator parameters for off-chain transactions.The light node can verify the existence/non-existence proof by the summary of the latest block and the parameters of RSA accumulator.Theoretical analysis and simulation experimental results show that the proposed solution have achieved the expected design and security goals with less computing overhead,and reasonable storage and communication overheads.

关 键 词：区块链 轻节点 交易存在证明 交易非存在证明 RSA累加器 Merkle山脉 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]