一种面向区块链系统的轻量级高效可验证查询方法  

Lightweight and Efficient Verifiable Query Scheme for Blockchain

作　　者：孙文鹏 王硕[1] 李京[1] SUN Wenpeng;WANG Shuo;LI Jing(School of Computer Science and Technology,University of Science and Technology of China,Hefei 230026,China)

机构地区：[1]中国科学技术大学计算机科学与技术学院,合肥230026

出　　处：《小型微型计算机系统》2024年第8期1944-1952,共9页Journal of Chinese Computer Systems

基　　金：安徽省高校省级质量工程重大教育教学改革研究项目(2019zdjg30)资助.

摘　　要：近年来,随着区块链技术的广泛应用,各种场景下的应用对链上数据的查询需求与日俱增.针对区块链网络中轻节点的可验证查询问题,本文充分利用区块链的结构特性,提出一种新的轻量且高效的可验证查询方案,以支持对链上数据可验证的布尔范围查询.该方案将查询过程分为块间过滤和块内查询两阶段,针对块内查询,本文设计了一种简化的Merkle-B树结构,在兼顾查询效率的同时减少验证信息的大小,针对块间过滤,本文提出了两种分别基于布隆过滤器和位图的新型可验证数据结构,以高效支持对不同查询的批量处理和验证.安全性分析证明了该方案的可验证性;相关对比实验表明了该方案具有较好的查询性能和较低的开销.With the wide use of blockchain,there is a growing demand for queries on data stored in the blockchain in recent years.To solve the verifiable query problem of light nodes in the blockchain network,we propose a lightweight verifiable query scheme that supports efficient verifiable boolean range queries.In the scheme,the query process is divided into two stages:inter-block filtering and intra-block query.For intra-block query,we design a simplified Merkle-B tree to reduce the size of validation object while processing queries efficiently.And two authenticated data structures based on bloom filter and bitmap are proposed for inter-block filtering,which support batch processing efficiently.Security analysis proves the verifiability of the scheme,and experiments confirm that it has higher performance and lower cost.

关 键 词：区块链 可验证查询 默克树 布隆过滤器 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]