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

被引：0
|
作者：
Liu F. [1 ,3 ]
Yang J. [2 ]
Li Z. [3 ]
Qi J. [2 ]
机构：
[1] School of Computer Science and Technology, East China Normal University, Shanghai
[2] Institute of Artificial Intelligence and Change Management, Shanghai University of International Business and Economics, Shanghai
[3] School of Data Science and Engineering, East China Normal University, Shanghai
来源：
Li, Zhibin (lizb@cs.ecnu.edu.cn); Qi, Jiayin (ai@suibe.edu.cn) | 2021年 / Science Press卷 / 58期
基金：
中国国家自然科学基金;
关键词：
Blockchain; BLS signature; Pedersen commitment; Privacy computing; Schnorr signature; Secure multi-party computation;
D O I：
10.7544/issn1000-1239.2021.20200751
中图分类号：
学科分类号：
摘要：
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. © 2021, Science Press. All right reserved.
引用
收藏
页码：281 / 290
页数：9
相关论文
共 24 条
  • [1] Liu Feng, Blockchain heat and enterprise opportunities, Enterprise Management, 442, 6, pp. 19-21, (2018)
  • [2] Chen Weili, Zheng Zibin, Blockchain data analysis: A review of status, trends and challenges, Journal of Computer Research and Development, 55, 9, pp. 1853-1870, (2018)
  • [3] Moser M, Soska K, Heilman E, Et al., An empirical analysis of traceability in the monero blockchain, Proceedings on Privacy Enhancing Technologies, 2018, 3, pp. 143-163, (2018)
  • [4] Ermilov D, Panov M, Yanovich Y., Automatic bitcoin address clustering, Proc of the IEEE Int Conf on Machine Learning & Applications, pp. 461-466, (2017)
  • [5] Song Jundian, Dai Bingrong, Jiang Liwen, Et al., Data governance collaborative method based on blockchain, Journal Computer Application, 38, 9, pp. 2500-2506, (2018)
  • [6] Boneh D, Lynn B, Shacham H., Short signatures from the Weil pairing, Proc of the Int Conf on the Theory and Application of cryptology and information security, pp. 514-532, (2001)
  • [7] Boneh D, Drijvers M, Neven G., Compact multi-signatures for smaller blockchains, Proc of the Int Conf on the Theory and Application of Cryptology and Information Security, pp. 435-464, (2018)
  • [8] Qian Qifeng, Cheng Chunling, Pairing-free certificateless group key agreement protocol for wireless sensor network, Computer Science, 42, 7, pp. 186-190, (2015)
  • [9] Su Jingfeng, Liu Juxia, Efficient certificateless aggregate signcryption scheme without bilinear pairings, Journal of Computer Applications, 38, 2, pp. 374-378, (2018)
  • [10] Yu G., Simple schnorr signature with pedersen commitment as key
123