Welcome to the resource topic for 2005/439
Title:
A note on the n-spendable extension of Ferguson’s single-term off-line coins
Authors: T. C. Lam
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.
ePrint: https://eprint.iacr.org/2005/439
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .