CryptoDB
A note on the n-spendable extension of Ferguson's single-term off-line coins
Authors: | |
---|---|
Download: | |
Abstract: | We show that an adversary can over-spend a coin n(n+1)! times without being detected and identified in the n-spendable extension of Ferguson's single-term off-line coin, simply by permuting the witness messages in the three-move zero-knowledge proof payment protocol. We repair the detection scheme by adding a simple verification rule in the payment protocol. We repair the identification scheme by restricting the identity format. |
BibTeX
@misc{eprint-2005-12772, title={A note on the n-spendable extension of Ferguson's single-term off-line coins}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / cryptanalysis, electronic commerce and payment}, url={http://eprint.iacr.org/2005/439}, note={ brianlam@tamu.edu 13117 received 10 Nov 2005, last revised 30 Nov 2005}, author={T. C. Lam}, year=2005 }