Paper 2005/439 Original: eprint.iacr.org/2005/439 ↗
A note on the n-spendable extension of Ferguson's single-term off-line coins
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-12-07: last updated
- 2005-12-07: published
- Short URL
- https://ia.cr/2005/439
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/439,
author = {T. C. Lam},
title = {A note on the n-spendable extension of Ferguson's single-term off-line coins},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/439},
year = {2005},
url = {https://eprint.iacr.org/2005/439}
}