We present the first fair e-cash system with a compact wallet that enables users to spend efficiently k coins while only sending to the merchant bits, where λ is a security parameter. The best previously known schemes require to transmit data of size at least linear in the number of spent coins. This result is achieved thanks to a new way to use the Batch RSA technique and a tree-based representation of the wallet. Moreover, we give a variant of our scheme with a less compact wallet but where the computational complexity of the spend operation does not depend on the number of spent coins, instead of being linear at best in existing systems. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Canard, S., Delerablée, C., Gouget, A., Hufschmitt, E., Laguillaumie, F., Sibert, H., … Vergnaud, D. (2009). Fair E-cash: Be compact, spend faster. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5735 LNCS, pp. 294–309). Springer Verlag. https://doi.org/10.1007/978-3-642-04474-8_24
Mendeley helps you to discover research relevant for your work.