A concrete instantiation of Bulletproof zero-knowledge proof
暂无分享,去创建一个
This work provides an instantiation of the Bulletproof zero-knowledge algorithm in modulo prime number fields. The primary motivation for this work is to help readers understand the steps of the Bulletproof protocol.
[1] Andrey Jivsov,et al. Compact representation of an elliptic curve point , 2014 .
[2] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[3] Dan Boneh,et al. Bulletproofs: Short Proofs for Confidential Transactions and More , 2018, 2018 IEEE Symposium on Security and Privacy (SP).