On blind signatures and perfect crimes
Computers and Security
An efficient fair payment system
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Trustee-based tracing extensions to anonymous cash and the making of anonymous change
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the International Workshop on Security Protocols
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
A Flexible Payment Scheme and Its Role-Based Access Control
IEEE Transactions on Knowledge and Data Engineering
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Restrictive binding of secret-key certificates
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A novel electronic cash system with trustee-based anonymity revocation from pairing
Electronic Commerce Research and Applications
| Hi-index | 0.07 |
Recently, Wang et al. have proposed an offline payment scheme providing scalable anonymity. The authors claim that their scheme can prevent a consumer from spending a coin more than once, since after a double-spending the identity of the consumer is revealed. In this paper, we show that in Wang et al.'s scheme, given a valid coin and without knowing any secret information, everyone is able to spend the coin as many times as he wants. In particular, we show how a cheater, using only public information, can construct a faked proof of ownership of the coin without running any risk of being discovered.