HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash

Abstract : Divisible e-cash, proposed in 1991 by Okamoto and Ohta, addresses a practical concern of electronic money, the problem of paying the exact amount. Users of such systems can indeed withdraw coins of a large value N and then divide it into many pieces of any desired values V≤N. Such a primitive therefore allows to avoid the use of several denominations or change issues. Since its introduction, many constructions have been proposed but all of them make use of the same framework: they associate each coin with a binary tree, which implies, at least, a logarithmic complexity for the spendings. In this paper, we propose the first divisible e-cash system without such a tree structure, and so without its inherent downsides. Our construction is the first one to achieve constant-time spendings while offering a quite easy management of the coins. It compares favorably with the state-of-the-art, while being provably secure in the standard model.
Document type :
Conference papers
Complete list of metadata

Contributor : David Pointcheval Connect in order to contact the contributor
Submitted on : Monday, February 20, 2017 - 12:53:38 PM
Last modification on : Thursday, March 17, 2022 - 10:08:37 AM




David Pointcheval, Olivier Sanders, Jacques Traoré. Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash. Public-Key Cryptography - PKC 2017 - 20th International Conference on Practice and Theory in Public-Key Cryptography, Mar 2017, Amsterdam, Netherlands. pp.61-90, ⟨10.1007/978-3-662-54365-8_4⟩. ⟨hal-01471876⟩



Record views