Change search
ReferencesLink to record
Permanent link

Direct link
A universally composable scheme for electronic cash
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
2005 (English)In: PROGRESS IN CRYPTOLOGY: INDOCRYPT 2005, PROCEEDINGS / [ed] aitra, S; Madhavan, CEV; Venkatesan, R, 2005, Vol. 3797, 347-360 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2005. Vol. 3797, 347-360 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 3797
National Category
Computer Science
URN: urn:nbn:se:kth:diva-42688DOI: 10.1007/11596219_28ISI: 000234716000028ScopusID: 2-s2.0-33646839647ISBN: 3-540-30805-9OAI: diva2:447526
6th International Conference on Cryptology in India. Bangalore, INDIA. DEC 10-12, 2005
QC 20111011Available from: 2011-10-12 Created: 2011-10-11 Last updated: 2011-10-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Trolin, Mårten
By organisation
Numerical Analysis and Computer Science, NADA
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 7 hits
ReferencesLink to record
Permanent link

Direct link