Efficient Divisible E-Cash in the Standard Model
Jiangxiao Zhang, Zhoujun Li, Hua Guo, Chang Liang Xu · 2013
We construct an efficient divisible e-cash scheme without random oracle by using the recent Groth-Sahai(GS) proof system. Our scheme is off-line and truly anonymous without a trusted third party. The efficiency of the construction of the binary tree and the withdrawal protocol are improved by exploring a new generation algorithm. Moreover, we use a technique to prove the correct monetary value spent by the user. Some security properties of our scheme, such as anonymous, divisible, unforgeability and exculpability, are proved in the standard model.