Achieving Optimal Anonymity in Transferable E-Cash with a Judge - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Achieving Optimal Anonymity in Transferable E-Cash with a Judge

Résumé

Electronic cash (e-cash) refers to money exchanged electronically. The main features of traditional cash are usually considered desirable also in the context of e-cash. One such property is off-line transferability, meaning the recipient of a coin in a transaction can transfer it in a later payment transaction to a third person without contacting a central authority. Among security properties, the anonymity of the payer in such transactions has been widely studied. This paper proposes the first efficient and secure transferable e-cash scheme with the strongest achievable anonymity properties, introduced by Canard and Gouget. In particular, it should not be possible for adversaries who receive a coin to decide whether they have owned that coin before. Our proposal is based on two recent cryptographic primitives: the proof system by Groth and Sahai, whose randomizability enables strong anonymity, and the commuting signatures by Fuchsbauer, which allow one to sign values that are only given as encryptions.

Dates et versions

hal-01110485 , version 1 (28-01-2015)

Identifiants

Citer

Olivier Blazy, Sébastien Canard, Georg Fuchsbauer, Aline Gouget, Hervé Sibert, et al.. Achieving Optimal Anonymity in Transferable E-Cash with a Judge. AFRICACRYPT 2011 - 4th International Conference on Cryptology in Africa, Jul 2011, Dakar, Senegal. pp.206-223, ⟨10.1007/978-3-642-21969-6_13⟩. ⟨hal-01110485⟩
171 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More