Transferred Cash Grows in Size. Chaum, D. & Pedersen, T. P. 05/1992 1992. ![Transferred Cash Grows in Size [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.
@conference {DBLP:conf/eurocrypt/ChaumP92,
title = {Transferred Cash Grows in Size},
booktitle = {EUROCRYPT{\textquoteright}92 Workshop on the Theory and Application of of Cryptographic Techniques},
series = {Lecture Notes in Computer Science},
volume = {658},
year = {1992},
month = {05/1992},
pages = {390-407},
publisher = {Springer},
organization = {Springer},
address = {Balatonf{\"u}red, Hungary},
abstract = {All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.},
keywords = {electronic money, forward traceability, secret shraing, transfer},
isbn = {3-540-56413-6},
doi = {10.1007/3-540-47555-9_32},
url = {10.1007/3-540-47555-9_32},
author = {David Chaum and Torben P. Pedersen}
}
Downloads: 0
{"_id":"HLN7TQ5K7tNtRfT5p","bibbaseid":"chaum-pedersen-transferredcashgrowsinsize-1992","downloads":0,"creationDate":"2018-07-03T04:50:29.972Z","title":"Transferred Cash Grows in Size","author_short":["Chaum, D.","Pedersen, T. P."],"year":1992,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Transferred Cash Grows in Size","booktitle":"EUROCRYPT\\textquoteright92 Workshop on the Theory and Application of of Cryptographic Techniques","series":"Lecture Notes in Computer Science","volume":"658","year":"1992","month":"05/1992","pages":"390-407","publisher":"Springer","organization":"Springer","address":"Balatonfüred, Hungary","abstract":"All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.","keywords":"electronic money, forward traceability, secret shraing, transfer","isbn":"3-540-56413-6","doi":"10.1007/3-540-47555-9_32","url":"10.1007/3-540-47555-9_32","author":[{"firstnames":["David"],"propositions":[],"lastnames":["Chaum"],"suffixes":[]},{"firstnames":["Torben","P."],"propositions":[],"lastnames":["Pedersen"],"suffixes":[]}],"bibtex":"@conference {DBLP:conf/eurocrypt/ChaumP92,\n\ttitle = {Transferred Cash Grows in Size},\n\tbooktitle = {EUROCRYPT{\\textquoteright}92 Workshop on the Theory and Application of of Cryptographic Techniques},\n\tseries = {Lecture Notes in Computer Science},\n\tvolume = {658},\n\tyear = {1992},\n\tmonth = {05/1992},\n\tpages = {390-407},\n\tpublisher = {Springer},\n\torganization = {Springer},\n\taddress = {Balatonf{\\\"u}red, Hungary},\n\tabstract = {All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.},\n\tkeywords = {electronic money, forward traceability, secret shraing, transfer},\n\tisbn = {3-540-56413-6},\n\tdoi = {10.1007/3-540-47555-9_32},\n\turl = {10.1007/3-540-47555-9_32},\n\tauthor = {David Chaum and Torben P. Pedersen}\n}\n","author_short":["Chaum, D.","Pedersen, T. P."],"key":"DBLP:conf/eurocrypt/ChaumP92","id":"DBLP:conf/eurocrypt/ChaumP92","bibbaseid":"chaum-pedersen-transferredcashgrowsinsize-1992","role":"author","urls":{"Paper":"https://gnunet.org/bibliography/export/10.1007/3-540-47555-9_32"},"keyword":["electronic money","forward traceability","secret shraing","transfer"],"downloads":0},"search_terms":["transferred","cash","grows","size","chaum","pedersen"],"keywords":["electronic money","forward traceability","secret shraing","transfer"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}