Electronic Cash with Blind Deposits: How to Have No Spare Change
Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a closely prescribed manner, different batches of coins ("wallets") will...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://hdl.handle.net/1721.1/30427 |
| _version_ | 1826209433432096768 |
|---|---|
| author | Liskov, Moses |
| author2 | Theory of Computation |
| author_facet | Theory of Computation Liskov, Moses |
| author_sort | Liskov, Moses |
| collection | MIT |
| description | Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a closely prescribed manner, different batches of coins ("wallets") will be linked together in these schemes. This is illustrated by the problem of what a customer does with the "spare change" - an unusable small amount of money left in a wallet. We propose a new protocol to be used in e-cash schemes: blind deposits. In a blind deposit, a customer returns a coin to the bank without revealing the coin. We present a secure and efficient e-cash scheme with this added feature based on that of Liskov-Micali [LM01]. |
| first_indexed | 2024-09-23T14:22:26Z |
| id | mit-1721.1/30427 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:22:26Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/304272019-04-10T16:14:24Z Electronic Cash with Blind Deposits: How to Have No Spare Change Liskov, Moses Theory of Computation Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a closely prescribed manner, different batches of coins ("wallets") will be linked together in these schemes. This is illustrated by the problem of what a customer does with the "spare change" - an unusable small amount of money left in a wallet. We propose a new protocol to be used in e-cash schemes: blind deposits. In a blind deposit, a customer returns a coin to the bank without revealing the coin. We present a secure and efficient e-cash scheme with this added feature based on that of Liskov-Micali [LM01]. 2005-12-22T12:00:00Z 2005-12-22T12:00:00Z 2003-10-14 MIT-CSAIL-TR-2003-022 MIT-LCS-TM-639 http://hdl.handle.net/1721.1/30427 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 13 p. 12754502 bytes 526739 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Liskov, Moses Electronic Cash with Blind Deposits: How to Have No Spare Change |
| title | Electronic Cash with Blind Deposits: How to Have No Spare Change |
| title_full | Electronic Cash with Blind Deposits: How to Have No Spare Change |
| title_fullStr | Electronic Cash with Blind Deposits: How to Have No Spare Change |
| title_full_unstemmed | Electronic Cash with Blind Deposits: How to Have No Spare Change |
| title_short | Electronic Cash with Blind Deposits: How to Have No Spare Change |
| title_sort | electronic cash with blind deposits how to have no spare change |
| url | http://hdl.handle.net/1721.1/30427 |
| work_keys_str_mv | AT liskovmoses electroniccashwithblinddepositshowtohavenosparechange |