A concrete instantiation of Bulletproof zero-knowledge proof [article]

Andrey Jivsov
2019 IACR Cryptology ePrint Archive  
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. Notations We follow notations in [1] with following additional notations. || denotes concatenation. a ← a • b means that after this line the value of a equals to the previous value of a times b. This is a local operation limited to the relevant function, e.g. we don't change the
more » ... bal a. G + is used to denote "positive" half of elements in G, as defined in sec. 3. We use G + for comparison or for public elements in G.
dblp:journals/iacr/Jivsov19 fatcat:wsjxffbs5bhgjcs66kpommease