Skip to Main content Skip to Navigation

Transferable e-cash: an analysis in the Algebraic Group Model

Balthazar Bauer 1, 2, 3
Abstract : Transferable e-cash is the most faithful digital analog of physical cash, as it allows users to transfer coins between themwithout interacting with the bank. Strong anonymity requirements and the need for mechanisms to trace illegal behavior(double-spending of coins) have made instantiating the concept notoriously hard. Baldimtsi et al. (PKC’15) have given afirst instantiation, which however relied on a powerful cryptographic primitive that made the scheme non-practical. In thisthesis we revisit the model for transferable e-cash, proposing simpler yet stronger security definitions and then give thefirst concrete instantiation of the primitive, basing it on bilinear groups, and analyze its concrete efficiency. Because tobuild our scheme, we are using non-standard assumption in a bilinear group context, we analyze the hardness of a broadclass of assumptions in a relevant context: the algebraic group model.
Document type :
Complete list of metadata
Contributor : Balthazar Bauer Connect in order to contact the contributor
Submitted on : Wednesday, December 23, 2020 - 10:24:57 AM
Last modification on : Friday, January 21, 2022 - 3:19:11 AM


Files produced by the author(s)


  • HAL Id : tel-03086982, version 1



Balthazar Bauer. Transferable e-cash: an analysis in the Algebraic Group Model. Cryptography and Security [cs.CR]. ED 386 : École doctorale de sciences mathématiques de Paris centre, UPMC, 2020. English. ⟨tel-03086982⟩



Les métriques sont temporairement indisponibles