Paper 2014/046

Crypto-analyses on “user efficient recoverable off-line e-cashs scheme with fast anonymity revoking”

Yalin Chen and Jue-Sam Chou

Abstract

Recently, Fan et al. proposed a user efficient recoverable off-line e-cash scheme with fast anonymity revoking. They claimed that their scheme could achieve security requirements of an e-cash system such as, anonymity, unlinkability, double spending checking, anonymity control, and rapid anonymity revoking on double spending. They further formally prove the unlinkability and the un-forgeability security features. However, after crypto-analysis, we found that the scheme cannot attain the two proven security features, anonymity and unlinkability. We, therefore, modify it to comprise the two desired requirements which are very important in an e-cash system.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MAJOR revision.
Keywords
anonymityunlikabilitycryptanalysis
Contact author(s)
jschou @ mail nhu edu tw
History
2014-01-20: received
Short URL
https://ia.cr/2014/046
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/046,
      author = {Yalin Chen and Jue-Sam Chou},
      title = {Crypto-analyses on “user efficient recoverable off-line e-cashs scheme with fast anonymity revoking”},
      howpublished = {Cryptology ePrint Archive, Paper 2014/046},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/046}},
      url = {https://eprint.iacr.org/2014/046}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.