Transferable Constant-Size Fair E-Cash

Georg Fuchsbauer; David Pointcheval; Damien Vergnaud

doi:10.1007/978-3-642-10433-6_15

Conference papers

Transferable Constant-Size Fair E-Cash

Georg Fuchsbauer ^{1, 2} David Pointcheval ^{1, 2} Damien Vergnaud ^{1, 2, 3, 4, *}

* Corresponding author

1 LIENS - Laboratoire d'informatique de l'école normale supérieure

2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities

DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548

3 LMNO - Laboratoire de Mathématiques Nicolas Oresme

4 Cosec, B-IT - Computer Security group [Bonn]

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.

Document type :

Conference papers

Domain :

Computer Science [cs] / Cryptography and Security [cs.CR]

Complete list of metadatas

Cited literature [32 references] Display Hide Download

https://hal.inria.fr/inria-00539543
Contributor : David Pointcheval <>
Submitted on : Wednesday, November 24, 2010 - 3:39:27 PM
Last modification on : Tuesday, September 22, 2020 - 3:51:43 AM
Long-term archiving on: : Friday, February 25, 2011 - 2:51:29 AM

Transferable Constant-Size Fair E-Cash

File

Identifiers

Collections

Citation

Export

Metrics

368

483

Transferable Constant-Size Fair E-Cash

File

Identifiers

Collections

Citation

Export

Share

Metrics

368

483