Paper 2005/341

A Universally Composable Scheme for Electronic Cash

Marten Trolin

Abstract

We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-secure encryption scheme, a CMA-secure signature scheme, and a family of one-way, collision-free hash functions. In particular, the security proof is not in the random-oracle model. Due to its high efficiency, the scheme is well-suited for devices such as smart-cards and mobile phones. We also show how the proposed scheme can be used as a group signature scheme with one-time keys.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Extended abstract at Indocrypt 2005. This is the full version.
Keywords
electronic cash
Contact author(s)
marten @ nada kth se
History
2005-10-11: last of 3 revisions
2005-09-27: received
See all versions
Short URL
https://ia.cr/2005/341
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/341,
      author = {Marten Trolin},
      title = {A Universally Composable Scheme for Electronic Cash},
      howpublished = {Cryptology ePrint Archive, Paper 2005/341},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/341}},
      url = {https://eprint.iacr.org/2005/341}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.