一种基于区块链的泛用型数据隐私保护的安全多方计算协议

刘峰; 杨杰; 李志斌; 齐佳音

doi:10.7544/issn1000-1239.2021.20200751

一种基于区块链的泛用型数据隐私保护的安全多方计算协议

¹(华东师范大学计算机科学与技术学院上海 200062)
²(上海对外经贸大学人工智能与变革管理研究院上海 200336)
³(华东师范大学数据科学与工程学院上海 200062) (lsttoy@163.com)

基金项目: 国家重点研发计划项目(2017YFB0803304)；国家自然科学基金项目(72042004)

详细信息

中图分类号: TP301.4
计量
- 文章访问数: 2329
- HTML全文浏览量: 7
- PDF下载量: 1260
出版历程
- 发布日期: 2021-01-31

A Secure Multi-Party Computation Protocol for Universal Data Privacy Protection Based on Blockchain

¹(School of Computer Science and Technology, East China Normal University, Shanghai 200062)
²(Institute of Artificial Intelligence and Change Management, Shanghai University of International Business and Economics, Shanghai 200336)
³(School of Data Science and Engineering, East China Normal University, Shanghai 200062)

Funds: This work was supported by the National Key Research and Development Program of China (2017YFB0803304) and the National Natural Science Foundation of China (72042004).

摘要

摘要: 近年来，如何合理有效地在区块链上实现用户隐私数据保护是区块链技术领域的一个关键性问题.针对此问题，设计出一种基于Pedersen承诺与Schnorr协议的安全多方计算协议(protocol of blockchain based on Pedersen commitment linked Schnorr protocol for multi-party computation，BPLSM).通过构筑该协议架构并进行形式化证明演算，表明了该协议能够融入区块链网络、能够在匿名情况下合并不同隐私消息并进行高效签署的特点.此外分析了协议的性质与安全性，证明了在区块链中应用BPLSM协议的泛用型隐私计算方案计算上的低算力开销,并具备良好的信息隐蔽性.最后对协议进行实验仿真，结果表明：在小范围人数固定的多方计算中,BPLSM协议验签的时间成本比当前主流的BLS签名节省约83.5%.
- 区块链 /
- 隐私计算 /
- 安全多方计算 /
- Pedersen承诺 /
- Schnorr签名 /
- BLS签名
Abstract: Recent years, how to protect user privacy data on the blockchain reasonably and efficiently is a key issue in the current blockchain technology field. Based on this, in this paper, a secure multi-party computation protocol is designed based on the Pedersen commitment and Schnorr protocol (protocol of blockchain based on Pedersen commitment linked schnorr protocol for multi-party computation, BPLSM). Through constructing the structure of the protocol and carrying out formal proof calculations, it is confirmed that the protocol can be integrated into the blockchain network to merge different private messages for efficient signing under anonymity. In addition, by analyzing the nature and security of the protocol, it can be proved that the overhead about computation of the general-purpose privacy computing scheme using the BPLSM protocol on the blockchain is low, and it also has strong information imperceptibility. In the end, experimental simulation results show that the time cost of BPLSM protocol verification in a small-scale multi-party transaction with a fixed number of people is about 83.5% lower than that of the current mainstream BLS signature.
- blockchain /
- privacy computing /
- secure multi-party computation /
- Pedersen commitment /
- Schnorr signature /
- BLS signature

HTML全文

参考文献(0)

施引文献(5)

期刊类型引用(3)

1.	李玉琦，李龙. 基于模式识别算法的网页重复信息抽取仿真. 计算机仿真. 2022(03): 439-443 . 百度学术
2.	王璐，文武松. 基于人工智能的分布式入侵检测研究. 计算机科学. 2022(10): 353-357 . 百度学术
3.	庞家乐，张彦. 反向梯度深度学习下重复网络数据标注仿真. 计算机仿真. 2022(10): 467-470+485 . 百度学术