检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Jin Wang WeiOu Wenhai Wang RSimon Sherratt Yongjun Ren Xiaofeng Yu
机构地区:[1]School of Computer&Communication Engineering,Changsha University of Science&Technology,Changsha,410004,China [2]School of Control Science and Engineering,Zhejiang University,Hangzhou,310058,China [3]School of Systems Engineering,The University of Reading,Reading,RG66AY,UK [4]School of Computer,Engineering Research Center of Digital Forensics of Ministry of Education,Nanjing University of Information Science&Technology,Nanjing,210044,China [5]School of Business,Nanjing University,Nanjing,210093,China
出 处:《Computers, Materials & Continua》2023年第3期4933-4950,共18页计算机、材料和连续体(英文)
基 金:This work is supported by the Fundamental Research Funds for the central Universities(Zhejiang University NGICS Platform),Xiaofeng Yu receives the grant and the URLs to sponsors’websites are https://www.zju.edu.cn/.And the work are supported by China’s National Natural Science Foundation(No.62072249,62072056);JinWang and Yongjun Ren receive the grant and the URLs to sponsors’websites are https://www.nsfc.gov.cn/.This work is also funded by the National Science Foundation of Hunan Province(2020JJ2029);Jin Wang receives the grant and the URLs to sponsors’websites are http://kjt.hunan.gov.cn/.
摘 要:With the rapid development of information technology,the development of blockchain technology has also been deeply impacted.When performing block verification in the blockchain network,if all transactions are verified on the chain,this will cause the accumulation of data on the chain,resulting in data storage problems.At the same time,the security of data is also challenged,which will put enormous pressure on the block,resulting in extremely low communication efficiency of the block.The traditional blockchain system uses theMerkle Tree method to store data.While verifying the integrity and correctness of the data,the amount of proof is large,and it is impossible to verify the data in batches.A large amount of data proof will greatly impact the verification efficiency,which will cause end-to-end communication delays and seriously affect the blockchain system’s stability,efficiency,and security.In order to solve this problem,this paper proposes to replace the Merkle tree with polynomial commitments,which take advantage of the properties of polynomials to reduce the proof size and communication consumption.By realizing the ingenious use of aggregated proof and smart contracts,the verification efficiency of blocks is improved,and the pressure of node communication is reduced.
关 键 词:Blockchain cryptographic commitment smart contract data storage
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.223.25