Efficient divisible E-cash in the standard model

Jiangxiao Zhang, Zhoujun Li, Hua Guo, Chang Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013
Pages2123-2128
Number of pages6
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013 - Beijing, China
Duration: 20 Aug 201323 Aug 2013

Publication series

NameProceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

Conference

Conference2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013
Country/TerritoryChina
CityBeijing
Period20/08/1323/08/13

Keywords

  • Accumulator
  • Binary tree
  • Divisible E-cash
  • Groth-Sahai proof

Fingerprint

Dive into the research topics of 'Efficient divisible E-cash in the standard model'. Together they form a unique fingerprint.

Cite this