基于布隆过滤器的零知识集成员证明效率提升  

Efficiency Improvement of Zero-Knowledge Set Membership Proof Based on Bloom Filter

作　　者：杨书鑫 李鹏[1,2] YANG Shuxin;LI Peng(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China;Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks,Jiangsu Province,Nanjing 210023,China)

机构地区：[1]南京邮电大学计算机学院,江苏南京210023 [2]江苏省无线传感网高技术研究重点实验室,江苏南京210023

出　　处：《软件工程》2024年第7期47-51,60,共6页Software Engineering

基　　金：国家自然科学基金(62102196);江苏省六大人才高峰高层次人才项目(RJFW-111)资助。

摘　　要：针对区块链中数据的安全验证问题(数据的动态增加导致零知识集成员证明参数更新频繁、参数生成和验证时间变长),进行了创新性的完善。提出了一种新型的数据存储模型,结合优化的跳表索引,提高了数据验证的安全性和效率。实验结果表明,基于布隆过滤器的新型数据存储模型和外部索引,虽然增加了空间复杂度,但是借助预校验机制,提高了约45%的安全校验速度。此外,优化后的时间跳表总体上提高了约50%的区块检索速度,并且索引更新更加便捷。In response to the security verification issues of data in blockchain(frequent parameter updates in zeroknowledge set membership proof due to dynamic data growth,leading to longer parameter generation and validation times),innovative enhancement has been made.This paper proposes a novel data storage model,incorporating optimized skip list indexing to enhance both data verification security and efficiency.Experimental results indicate that although the new data storage model based on Bloom filters and external indexing increases space consumption,it improves security verification speed by approximately 45%with the aid of a pre-validation mechanism.Additionally,the optimized time skip list generally increases block retrieval speed by about 50%and makes index updates more convenient.

关 键 词：区块链 零知识集成员证明 数据存储模型 布隆过滤器 跳表 

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