Title :
Single-term divisible electronic cash based on bit commitment
Author :
Zhong, Ming ; Feng, Yunbo ; Yang, Yixian
Author_Institution :
Inf. Security Center, Beijing Univ. of Posts & Telecommun., China
Abstract :
In the literature, several “divisible” untraceable offline electronic cash schemes have been presented. 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(log N), 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
Keywords :
communication complexity; electronic money; protocols; theorem proving; bit commitment; clarified assumptions; complexity; divisibility precision; divisible untraceable offline electronic cash schemes; minimum divisible unit value; one-time knowledge proof; protocol; single-term divisible electronic cash; total coin value; Binary trees; Complexity theory; Data mining; Information security; Polynomials; Protocols; Telecommunications;
Conference_Titel :
Computers and Communications, 2000. Proceedings. ISCC 2000. Fifth IEEE Symposium on
Conference_Location :
Antibes-Juan les Pins
Print_ISBN :
0-7695-0722-0
DOI :
10.1109/ISCC.2000.860651
