Single-term divisible electronic cash based on bit commitment

被引：1

作者：

Zhong, M ^{[1
]}

Feng, YB ^{[1
]}

Yang, YX ^{[1
]}

机构：

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

来源：

ISCC 2000: FIFTH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS | 2000年

关键词：

electronic cash; bit commitment; one-time knowledge proof; blind signature;

D O I：

10.1109/ISCC.2000.860651

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In the literature, several "divisible" untraceable off-line electronic cash schemes have been presented. In this paper an efficient single-term divisible electronic cash based on bit commitment scheme and one-time knowledge proof is proposed. The complexity of every protocol in our scheme is O(logN), where N is the precision of divisibility, i.e., N=(the total coin value)/(minimum divisible unit value). This scheme overcomes the problems of previous schemes through its greater efficiency and clarified assumptions.

引用

页码：280 / 285

页数：6