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. © 2011 Springer-Verlag.
CITATION STYLE
Blazy, O., Canard, S., Fuchsbauer, G., Gouget, A., Sibert, H., & Traoré, J. (2011). Achieving optimal anonymity in transferable e-cash with a judge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6737 LNCS, pp. 206–223). https://doi.org/10.1007/978-3-642-21969-6_13
Mendeley helps you to discover research relevant for your work.