Fair E-Cash: Be Compact, Spend Faster

  • Authors:
  • Sébastien Canard;Cécile Delerablée;Aline Gouget;Emeline Hufschmitt;Fabien Laguillaumie;Hervé Sibert;Jacques Traoré;Damien Vergnaud

  • Affiliations:
  • Orange Labs R&D, Caen Cedex, France F-14066;UVSQ, Versailles Cedex, France 78035;Gemalto, Meudon, France 92190;Thalès Communications, Colombes, France 92704;GREYC, Université de Caen-Basse Normandie, France;ST-Ericsson, Le Mans Cedex 9, France 72100;Orange Labs R&D, Caen Cedex, France F-14066;École normale supérieure --- C.N.R.S. --- I.N.R.I.A., France

  • Venue:
  • ISC '09 Proceedings of the 12th International Conference on Information Security
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 $\mathcal{O}(\lambda\log k)$ bits, where *** 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.