Fair E-cash: Be Compact, Spend Faster - GREYC amacc Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
FairBatch.pdf (224.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00577257 , version 1 (16-03-2011)

Identifiers

Cite

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⟩
411 View
366 Download

Altmetric

Share

Gmail Facebook X LinkedIn More