Single-Term Divisible Electronic Cash Based on Bit Commitment

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ming Zhong Articles by Yunbo Feng Articles by Yixian Yang

Fifth IEEE Symposium on Computers and Communications (ISCC 2000)

Antibes, France

July 04-July 06

ISBN: 0-7695-0722-0

	ASCII Text	x
	Ming Zhong, Yunbo Feng, Yixian Yang, "Single-Term Divisible Electronic Cash Based on Bit Commitment," Computers and Communications, IEEE Symposium on, pp. 280, Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000.

	BibTex	x
	@article{ 10.1109/ISCC.2000.860651, author = {Ming Zhong and Yunbo Feng and Yixian Yang}, title = {Single-Term Divisible Electronic Cash Based on Bit Commitment}, journal ={Computers and Communications, IEEE Symposium on}, volume = {0}, year = {2000}, issn = {1530-1346}, pages = {280}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2000.860651}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computers and Communications, IEEE Symposium on TI - Single-Term Divisible Electronic Cash Based on Bit Commitment SN - 1530-1346 SP EP A1 - Ming Zhong, A1 - Yunbo Feng, A1 - Yixian Yang, PY - 2000 KW - electronic cash KW - bit commitment KW - one-time knowledge proof KW - blind signature VL - 0 JA - Computers and Communications, IEEE Symposium on ER -

Ming Zhong, Beijing University of Posts and Telecommunication

Yunbo Feng, Beijing University of Posts and Telecommunication

Yixian Yang, Beijing University of Posts and Telecommunication

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2000.860651

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.

Index Terms:

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

Citation:

Ming Zhong, Yunbo Feng, Yixian Yang, "Single-Term Divisible Electronic Cash Based on Bit Commitment," iscc, pp.280, Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.