Divisible e-cash from constrained pseudo-random functions

DOI10.1007/978-3-030-34578-5_24zbMath1456.94055OpenAlexW2931916182MaRDI QIDQ2181902

Florian Bourse, David Pointcheval, Olivier Sanders

Publication date: 20 May 2020

Full work available at URL: https://hal.inria.fr/hal-02357173/file/2019-136.pdf

zbMATH Keywords

new notion of pseudorandom functionssecurity model for divisible e-cash

Mathematics Subject Classification ID

Cryptography (94A60) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Black-box accumulation based on lattices ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Lattice-based e-cash, revisited ⋮ Transferable e-cash: a cleaner model and the first practical instantiation

This page was built for publication: Divisible e-cash from constrained pseudo-random functions