Show simple item record

dc.contributor.authorLiskov, Moses
dc.contributor.otherTheory of Computation
dc.date.accessioned2005-12-22T12:00:00Zen_US
dc.date.available2005-12-22T12:00:00Zen_US
dc.date.issued2003-10-14
dc.identifier.otherMIT-CSAIL-TR-2003-022
dc.identifier.otherMIT-LCS-TM-639
dc.identifier.urihttp://hdl.handle.net/1721.1/30427
dc.description.abstractElectronic 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].
dc.format.extent13 p.
dc.format.extent12754502 bytes
dc.format.extent526739 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.titleElectronic Cash with Blind Deposits: How to Have No Spare Change


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record