Skip to Main content Skip to Navigation
Conference papers

Fair E-cash: Be Compact, Spend Faster

Abstract : We present the first fair e-cash system with a compact wallet that enables users to spend efficiently k coins while only sending to the merchant O(l log(k)) bits, where l is a security parameter. The best previously known schemes require to transmit data of size at least linear in the number of spent coins. This result is achieved thanks to a new way to use the Batch RSA technique and a tree-based representation of the wallet. Moreover, we give a variant of our scheme with a less compact wallet but where the computational complexity of the spend operation does not depend on the number of spent coins, instead of being linear at best in existing systems.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00577257
Contributor : Damien Vergnaud Connect in order to contact the contributor
Submitted on : Wednesday, March 16, 2011 - 10:14:20 PM
Last modification on : Saturday, June 25, 2022 - 9:46:38 AM
Long-term archiving on: : Friday, June 17, 2011 - 2:48:04 AM

Files

FairBatch.pdf
Files produced by the author(s)

Identifiers

Citation

Sébastien Canard, Cécile Delerablée, Aline Gouget, Emeline Hufschmitt, Fabien Laguillaumie, et al.. Fair E-cash: Be Compact, Spend Faster. Information Security, 12th International Conference, ISC 2009, Sep 2009, Pisa, Italy. pp.294-309, ⟨10.1007/978-3-642-04474-8_24⟩. ⟨inria-00577257⟩

Share

Metrics

Record views

342

Files downloads

309