Transferable Constant-Size Fair E-Cash - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Transferable Constant-Size Fair E-Cash

Abstract

We propose a new blind certification protocol that provides interesting properties while remaining efficient. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a certified signature it immediately yields non-frameable group signatures. We then use it to build an efficient (offline) e-cash system that guarantees user anonymity and transferability of coins without increasing their size. As required for fair e-cash, in case of fraud, anonymity can be revoked by an authority, which is also crucial to deter from double spending.
Fichier principal
Vignette du fichier
2009_cans.pdf (312.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00539543 , version 1 (24-11-2010)

Identifiers

Cite

Georg Fuchsbauer, David Pointcheval, Damien Vergnaud. Transferable Constant-Size Fair E-Cash. Proceedings of the 8th International Workshop on Cryptology and Network Security (CANS '09), 2009, Kanazawa, Ishikawa, Japan. pp.226--247, ⟨10.1007/978-3-642-10433-6_15⟩. ⟨inria-00539543⟩
165 View
329 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More