Welcome to the resource topic for 2005/341
A Universally Composable Scheme for Electronic Cash
Authors: Marten TrolinAbstract:
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.
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 .