Communication Dans Un Congrès Année : 2012

Divisible E-Cash in the Standard Model

Résumé

Off-line e-cash systems are the digital analogue of regular cash. One of the main desirable properties is anonymity: spending a coin should not reveal the identity of the spender and, at the same time, users should not be able to double-spend coins without being detected. Compact e-cash systems make it possible to store a wallet of O(2 L ) coins using O(L + λ) bits, where λ is the security parameter. They are called divisible whenever the user has the flexibility of spending an amount of 2 ℓ , for some ℓ ≤ L, more efficiently than by repeatedly spending individual coins. This paper presents the first construction of divisible e-cash in the standard model (i.e., without the random oracle heuristic). The scheme allows a user to obtain a wallet of 2 L coins by running a withdrawal protocol with the bank. Our construction is built on the traditional binary tree approach, where the wallet is organized in such a way that the monetary value of a coin depends on how deep the coin is in the tree.

Fichier principal
Vignette du fichier
IL12.pdf (454.7 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05508299 , version 1 (13-02-2026)

Licence

Identifiants

  • HAL Id : hal-05508299 , version 1

Citer

Malika Izabachène, Benoît Libert. Divisible E-Cash in the Standard Model. Pairing-Based Cryptography - Pairing 2012 - 5th International Conference, May 2012, Cologne, France. ⟨hal-05508299⟩
18 Consultations
26 Téléchargements

Partager

  • More