Efficient Divisible E-Cash in the Standard Model

Author

Jiangxiao Zhang ; Zhoujun Li ; Hua Guo ; Chang Xu

Author_Institution

State Key Lab. of Software Dev. Environ., Beihang Univ., Beijing, China

fYear

2013

fDate

20-23 Aug. 2013

Firstpage

2123

Lastpage

2128

Abstract

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.

Keywords

electronic money; protocols; theorem proving; trees (mathematics); trusted computing; GS proof system; Groth-Sahai proof system; binary tree; divisible e-cash scheme; generation algorithm; monetary value; random oracle; security property; trusted third party; withdrawal protocol; Binary trees; Computational modeling; Databases; Protocols; Public key; Standards; Accumulator; Binary Tree; Divisible E-cash; Groth-Sahai Proof;

fLanguage

English

Publisher

ieee

Conference_Titel

Green Computing and Communications (GreenCom), 2013 IEEE and Internet of Things (iThings/CPSCom), IEEE International Conference on and IEEE Cyber, Physical and Social Computing

Conference_Location

Beijing

Type

conf

DOI

10.1109/GreenCom-iThings-CPSCom.2013.399

Filename

6682409