Abstract
Conditional e-payments (or e-cash) allow the user to anonymously cash a bank-issued e-coin at a future time if and only if a certain agreed-upon public condition is satisfied, which are useful in plenty of applications such as prediction markets, anonymous online betting, and securities trading. In this paper, we propose a new and efficient conditional e-payment system based on Chen et al.'s restrictive partially blind signature scheme. Compared to the existing conditional e-payment schemes [2,5,6], our construction requires neither the inefficient cut-and-choose techniques nor the complicated knowledge proof protocols and thus has lower computation and communication complexity. Another significant contribution of this paper is a conditional e-payment system with transferability which allows the coin to be further transferred anonymously by a chain of payees. © 2013 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 252-258 |
| Journal | Future Generation Computer Systems |
| Volume | 37 |
| Online published | 7 Aug 2013 |
| DOIs | |
| Publication status | Published - Jul 2014 |
Research Keywords
- Bilinear pairings
- Blind signatures
- Conditional e-payment
- Transferability
Fingerprint
Dive into the research topics of 'New and efficient conditional e-payment systems with transferability'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver