File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/11596219_27
- Scopus: eid_2-s2.0-33646848463
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Short e-cash
Title | Short e-cash |
---|---|
Authors | |
Keywords | Bilinear Pairing Coin-traceability E-cash |
Issue Date | 2005 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2005, v. 3797 LNCS, p. 332-346 How to Cite? |
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. © Springer-Verlag Berlin Heidelberg 2005. |
Persistent Identifier | http://hdl.handle.net/10722/280521 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Chow, Sherman S.M. | - |
dc.contributor.author | Susilo, Willy | - |
dc.date.accessioned | 2020-02-17T14:34:15Z | - |
dc.date.available | 2020-02-17T14:34:15Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2005, v. 3797 LNCS, p. 332-346 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280521 | - |
dc.description.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. © Springer-Verlag Berlin Heidelberg 2005. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.subject | Bilinear Pairing | - |
dc.subject | Coin-traceability | - |
dc.subject | E-cash | - |
dc.title | Short e-cash | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/11596219_27 | - |
dc.identifier.scopus | eid_2-s2.0-33646848463 | - |
dc.identifier.volume | 3797 LNCS | - |
dc.identifier.spage | 332 | - |
dc.identifier.epage | 346 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.issnl | 0302-9743 | - |