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.
Type de document :
Communication dans un congrès
Pierangela Samarati and Moti Yung and Fabio Martinelli and Claudio A. Ardagna. Information Security, 12th International Conference, ISC 2009, Sep 2009, Pisa, Italy. Springer, 5735, pp.294-309, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-04474-8_24〉
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00577257
Contributeur : Damien Vergnaud <>
Soumis le : mercredi 16 mars 2011 - 22:14:20
Dernière modification le : mardi 16 janvier 2018 - 11:12:03
Document(s) archivé(s) le : vendredi 17 juin 2011 - 02:48:04

Fichiers

FairBatch.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Sébastien Canard, Cécile Delerablée, Aline Gouget, Emeline Hufschmitt, Fabien Laguillaumie, et al.. Fair E-cash: Be Compact, Spend Faster. Pierangela Samarati and Moti Yung and Fabio Martinelli and Claudio A. Ardagna. Information Security, 12th International Conference, ISC 2009, Sep 2009, Pisa, Italy. Springer, 5735, pp.294-309, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-04474-8_24〉. 〈inria-00577257〉

Partager

Métriques

Consultations de la notice

476

Téléchargements de fichiers

223