跳到主要导航 跳到搜索 跳到主要内容

Efficient divisible E-cash in the standard model

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名Proceedings - 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
2123-2128
页数6
DOI
出版状态已出版 - 2013
活动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 - Beijing, 中国
期限: 20 8月 201323 8月 2013

出版系列

姓名Proceedings - 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

会议

会议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
国家/地区中国
Beijing
时期20/08/1323/08/13

学术指纹

探究 'Efficient divisible E-cash in the standard model' 的科研主题。它们共同构成独一无二的学术指纹。

引用此