@inproceedings{b0d13de1671c4e83a1f0165629d78eac,
title = "Short e-cash",
abstract = "We present a bandwidth-efficient off-line anonymous e-cash scheme with traceable coins. Once a user double-spends, his identity can be revealed and all his coins in the system can be traced, without resorting to TTP. For a security level comparable with 1024-bit standard RSA signature, the payment transcript size is only 512 bytes. Security of the proposed scheme is proven under the q-strong Diffie-Hellman assumption and the decisional linear assumption, in the random oracle model. The transcript size of our scheme can be further reduced to 192 bytes if external Diffie-Hellman assumption is made. Finally, we propose a variant such that there exists a TTP with the power to revoke the identity of a payee and trace all coins from the same user, which may be desirable when a malicious user is identified by some non-cryptographic means.",
keywords = "Bilinear Pairing, Coin-traceability, E-cash",
author = "Au, {Man Ho Allen} and Chow, {Sherman S.M.} and Willy Susilo",
year = "2005",
month = dec,
day = "1",
doi = "10.1007/11596219_27",
language = "English",
isbn = "3540308059",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "332--346",
booktitle = "Progress in Cryptology - INDOCRYPT 2005 - 6th International Conference on Cryptology in India, Proceedings",
note = "6th International Conference on Cryptology in India, INDOCRYPT 2005 ; Conference date: 10-12-2005 Through 12-12-2005",
}