A Novel Lattice-Based Blockchain Infrastructure and Its Application on Trusted Data Management

IF 6.7 2区计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-11 DOI:10.1109/TNSE.2025.3550158

Longbo Han;Gengran Hu;Xiaoting Li;Feifei Xia;Shengbao Wang;Lin You

{"title":"A Novel Lattice-Based Blockchain Infrastructure and Its Application on Trusted Data Management","authors":"Longbo Han;Gengran Hu;Xiaoting Li;Feifei Xia;Shengbao Wang;Lin You","doi":"10.1109/TNSE.2025.3550158","DOIUrl":null,"url":null,"abstract":"As a part of blockchain's infrastructure, the construction of Merkle trees typically relies on secure hash functions, such as SHA256. However, traditional blockchain systems face dual threats: quantum vulnerabilities in hash functions (e.g., Grover's algorithm reduces collision resistance) and inefficiencies in large-scale data verification. To address these challenges, we propose a parameter-hopping Merkle tree framework integrating a pseudo-random number generator (PRNG) with lattice-based cryptography. Our design ensures adaptive security through dynamic basis vector generation. This lattice-based structure offers flexibility in accommodating messages of varying sizes, supports distributed data storage, and enables efficient verification and querying of large-scale information streams. Key contributions include: a). A provably secure hash chain constructed via a family of extended-message-domain lattice-based hash functions (LBHFs), supporting arbitrary-length inputs. b). A variable-parameter Merkle tree protocol enabling efficient distributed data storage and query verification, with proof sizes optimized for P2P networks. c) A trusted data management prototype validated in a cloud storage scenario. Experimental results indicate that our blockchain infrastructure achieves enhanced security while maintaining high efficiency.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2524-2536"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10922084","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10922084/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

Abstract

As a part of blockchain's infrastructure, the construction of Merkle trees typically relies on secure hash functions, such as SHA256. However, traditional blockchain systems face dual threats: quantum vulnerabilities in hash functions (e.g., Grover's algorithm reduces collision resistance) and inefficiencies in large-scale data verification. To address these challenges, we propose a parameter-hopping Merkle tree framework integrating a pseudo-random number generator (PRNG) with lattice-based cryptography. Our design ensures adaptive security through dynamic basis vector generation. This lattice-based structure offers flexibility in accommodating messages of varying sizes, supports distributed data storage, and enables efficient verification and querying of large-scale information streams. Key contributions include: a). A provably secure hash chain constructed via a family of extended-message-domain lattice-based hash functions (LBHFs), supporting arbitrary-length inputs. b). A variable-parameter Merkle tree protocol enabling efficient distributed data storage and query verification, with proof sizes optimized for P2P networks. c) A trusted data management prototype validated in a cloud storage scenario. Experimental results indicate that our blockchain infrastructure achieves enhanced security while maintaining high efficiency.

查看原文本刊更多论文

一种基于格子的区块链结构及其在可信数据管理中的应用

作为b区块链基础设施的一部分，默克尔树的构建通常依赖于安全哈希函数，如SHA256。然而，传统的区块链系统面临双重威胁：哈希函数中的量子漏洞（例如，Grover算法降低了抗碰撞性）和大规模数据验证的低效率。为了解决这些挑战，我们提出了一种参数跳变的Merkle树框架，该框架将伪随机数生成器（PRNG）与基于格的密码学相结合。我们的设计通过动态基向量生成来保证自适应安全性。这种基于格的结构在容纳不同大小的消息方面提供了灵活性，支持分布式数据存储，并支持大规模信息流的有效验证和查询。主要贡献包括：a)。通过一系列基于扩展消息域格的哈希函数（lbhf）构建的可证明安全的哈希链，支持任意长度的输入。b)。可变参数的默克尔树协议，支持高效的分布式数据存储和查询验证，并针对P2P网络优化了证明大小。c)在云存储场景中验证的可信数据管理原型。实验结果表明，我们的区块链基础架构在保持高效率的同时提高了安全性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering

CiteScore

12.60

自引率

9.10%

发文量

393

期刊介绍： The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.