A universally composable scheme for electronic cash
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)
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
IdentifiersURN: urn:nbn:se:kth:diva-42688DOI: 10.1007/11596219_28ISI: 000234716000028ScopusID: 2-s2.0-33646839647ISBN: 3-540-30805-9OAI: oai:DiVA.org:kth-42688DiVA: diva2:447526
6th International Conference on Cryptology in India. Bangalore, INDIA. DEC 10-12, 2005
QC 201110112011-10-122011-10-112011-10-12Bibliographically approved