An efficient unlinkable electronic cash based on bit commitment

被引：0

作者：

Zhong, M ^{[1
]}

Yang, YX ^{[1
]}

机构：

[1] Beijing Univ Posts & Telecommun, Beijing 100876, Peoples R China

来源：

CHINESE JOURNAL OF ELECTRONICS | 2001年 / 10卷 / 02期

关键词：

electronic cash; bit commitment; partial blind signature;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, an efficient unlinkable, divisible electronic cash based on bit commitment scheme is proposed. The complexity of every protocol in our scheme is O(log N), where N is the precision of divisibility, i.e., N=(the total cash value)/(minimum divisible unit value). This scheme overcomes the problems of previous schemes through its greater efficiency and the real unlinkability of every cash it generated. We also proved the security of the proposed cash scheme under some clarified cryptographic assumptions.

引用

页码：255 / 258

页数：4