Single-Term Divisible Electronic Cash Based on Bit Commitment

Authors:
Ming Zhong;Yunbo Feng;Yixian Yang
Affiliations:
-;-;-
Venue:
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Year:
2000

Citing 3
Cited 1

Universal Electronic Cash

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Divisible Electronic Cash Scheme

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
New Protocols for Electronic Money

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology

Schemes for Digital Gift Certificates with Low Computation Complexity

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.