Welcome to the resource topic for 2014/785
Title:
Divisible E-Cash Made Practical
Authors: Sébastien Canard, David Pointcheval, Olivier Sanders, Jacques Traoré
Abstract:Divisible E-cash systems allow users to withdraw a unique coin of value 2^n from a bank, but then to spend it in several times to distinct merchants. In such a system, whereas users want anonymity of their transactions, the bank wants to prevent, or at least detect, double-spending, and trace the defrauders. While this primitive was introduced two decades ago, quite a few (really) anonymous constructions have been introduced. In addition, all but one were just proven secure in the random oracle model, but still with either weak security models or quite complex settings and thus costly constructions. The unique proposal, secure in the standard model, appeared recently and is unpractical. As evidence, the authors left the construction of an efficient scheme secure in this model as an open problem.
ePrint: https://eprint.iacr.org/2014/785
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .