Netinfo Security ›› 2019, Vol. 19 ›› Issue (10): 10-15.doi: 10.3969/j.issn.1671-1122.2019.10.002

Previous Articles     Next Articles

National Secret Substitution of zk-snark Bilinear Pair

Lin LI, Xuxia ZHANG()   

  1. School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
  • Received:2019-06-21 Online:2019-10-10 Published:2020-05-11
  • Contact: Xuxia ZHANG E-mail:17120488@bjtu.edu.cn

Abstract:

In recent years, with the emphasis on privacy protection, zero-knowledge proof technology has also developed rapidly. zk-snark is a compact non-interactive zero-knowledge proof protocol, in which the polynomial division algorithm is implemented by the fast Fourier transform algorithm, which requires that the order of the bilinear pair used by zk-snark satisfy formula: n-1|220. However, the bilinear pairing used in the current national secret SM9 algorithm does not meet this requirement. If the direct replacement with the existing bilinear pair is directly used, the performance of zk-snark will be greatly reduced. In this paper, based on the BN curve to construct a bilinear pairing method, a national secret substitution of zk-snark bilinear pairnally densified scheme of zk-snark bilinear pairing is proposed. Under the premise of not affecting the performance of zk-snark, the security requirements of the national secret are met, so that zk -snark can be applied to national secret products.

Key words: information security, bilinear pair, BN curve, zk-snark, SM9

CLC Number: