Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Flexible Payment Scheme and Its Role-Based Access Control
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
Recently, Wang, Cao, and Zhang proposed a practical and anonymous payment scheme. In the scheme, the authors claimed that their scheme can identify those who spend a coin more than once. That means the scheme can verify the payments in an offline batch process and prevent a consumer from double spending. In this paper, we show that Wang, Cao, and Zhang's scheme can not identify consumers those who spend the same coin repeatedly in two or more different shops at the same time. So, all consumers can apply the security flaw to perform double spending successfully. In order to overcome this security flaw, we provide an improved version of the scheme in this paper.