Divisible E-Cash Systems Can Be Truly Anonymous

  • Sébastien Canard
  • Aline Gouget
Conference paper

DOI: 10.1007/978-3-540-72540-4_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4515)
Cite this paper as:
Canard S., Gouget A. (2007) Divisible E-Cash Systems Can Be Truly Anonymous. In: Naor M. (eds) Advances in Cryptology - EUROCRYPT 2007. EUROCRYPT 2007. Lecture Notes in Computer Science, vol 4515. Springer, Berlin, Heidelberg

Abstract

This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2L that he can parceled and spend anonymously and unlinkably. We present the construction of a security tag that allows to protect the anonymity of honest users and to revoke anonymity only in case of cheat for protocols based on a binary tree structure without using a trusted third party. This is the first divisible e-cash scheme that provides both full unlinkability and anonymity without requiring a trusted third party.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sébastien Canard
    • 1
  • Aline Gouget
    • 2
  1. 1.France Télécom R&DCaenFrance
  2. 2.GemaltoMeudonFrance

Personalised recommendations