Article

Untraceable Off-line Cash in Wallets with Observers (Extended Abstract)

Author:

Stefan BrandsAuthors Info & Claims

CRYPTO '93: Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology

Pages 302 - 318

Published: 22 August 1993 Publication History

Abstract

We show how the electronic cash scheme in [Fer93a] can be extended to provide n -spendable coins. Furthermore, we show how observers can be incorporated in the protocols to provide prior restraint against double spending by the user, instead of just detection after the fact.

References

[1]

Bellare, Micali, "How To Sign Given Any Trapdoor Function," Proceedings of Crypto '88, Springer-Verlag, pages 200-215.

[2]

Brands, S., "An Efficient Off-line Electronic Cash System Based On The Representation Problem," CWI Technical Report CS-R9323, April 11, 1993.

[3]

Brands, S., "Untraceable Off-Line Cash Based On The Representation Problem," manuscript. To be published as a CWI Technical Report in Januari/Februari 1994.

[4]

Brickell, E. and McCurley, K., "An Interactive Identification Scheme Based On Discrete Logarithms And Factoring," Journal of Cryptology, Vol. 5 no. 1 (1992), pages 29-39.

[5]

Chaum, D., "Achieving Electronic Privacy," Scientific American, August 1992, pages 96-101.

[6]

Chaum, D., "Security Without Identification: Transaction Systems To Make Big Brother Obsolete," Communications of the ACM, Vol. 28 no. 10, October 1985, pages 1020-1044.

[7]

Chaum, D., "Card-computer moderated systems," (unpublished), 1989.

[8]

Chaum, D., Fiat, A. and Naor, M., "Untraceable Electronic Cash," Proceedings of Crypto '88, Springer-Verlag, pages 319-327.

[9]

Chaum, D. and Pedersen, T., "Wallet Databases With Observers," Preproceedings of Crypto '92.

[10]

Cramer, R. and Pedersen, T., "Improved Privacy In Wallets With Observers', Preproceedings of EuroCrypt '93.

[11]

Ferguson, N., "Single Term Off-Line Coins", Preproceedings of EuroCrypt '93.

[12]

Ferguson, N., "Extensions Of Single-Term Off-Line coins," these proceedings.

[13]

Fiat, A. and Shamir, A., "How To Prove Yourself: Practical Solutions To Identification And Signature Problems," Proceedings of Crypto '86, Springer-Verlag, pages 186-194.

[14]

Okamoto, T., "Provably Secure And Practical Identification Schemes And Corresponding Signature Schemes," Preproceedings of Crypto '92.

[15]

Schnorr, CP., "Efficient Signature Generation By Smart Cards," Journal of Cryptology, Vol. 4 no. 3 (1991), pages 161-174.

[16]

"No Hiding Place / Big Brother Is Clocking You," The Economist, August 7th- 13th 1993.

Cited By

Choi SKatz JSchröder DYerukhimovich AZhou H(2019)(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless TokensJournal of Cryptology10.1007/s00145-018-9288-x32:2(459-497)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s00145-018-9288-x
Dimitriou TKarame G(2017)Enabling Anonymous Authorization and Rewarding in the Smart GridIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2015.249621114:5(565-572)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1109/TDSC.2015.2496211
Camenisch JDrijvers MHajny JWeippl EKatzenbeisser SDe Capitani di Vimercati S(2016)Scalable Revocation Scheme for Anonymous Credentials Based on n-times Unlinkable ProofsProceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society10.1145/2994620.2994625(123-133)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2994620.2994625
Show More Cited By

Recommendations

A new untraceable off-line electronic cash system

Digital content transactions through e-commerce will grow tremendously in the coming years. In this respect, well-designed electronic payment schemes and high-quality digital contents are two critical factors. Untraceable electronic cash schemes make it ...
Untraceable off-line electronic cash flow in e-commerce

Electronic cash has been playing an important role in electronic - commerce. One of the desirable characteristics is its traceability, which can prevent money laundering and can find the destination of suspicious withdrawals.In this paper we develop a ...
Recoverable and untraceable e-cash
EuroPKI'05: Proceedings of the Second European conference on Public Key Infrastructure

In an electronic cash (e-cash) system, Recoverability means once you have lost your e-cash, you still can get back the amount of e-cash that you have lost. Untraceability means no one can trace where and when you have spent your e-cash. Obviously these ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

CRYPTO '93: Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology

August 1993

491 pages

ISBN:3540577661

Editor:
Douglas R. Stinson

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 August 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Choi SKatz JSchröder DYerukhimovich AZhou H(2019)(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless TokensJournal of Cryptology10.1007/s00145-018-9288-x32:2(459-497)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s00145-018-9288-x
Dimitriou TKarame G(2017)Enabling Anonymous Authorization and Rewarding in the Smart GridIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2015.249621114:5(565-572)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1109/TDSC.2015.2496211
Camenisch JDrijvers MHajny JWeippl EKatzenbeisser SDe Capitani di Vimercati S(2016)Scalable Revocation Scheme for Anonymous Credentials Based on n-times Unlinkable ProofsProceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society10.1145/2994620.2994625(123-133)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2994620.2994625
Heilman EKendler AZohar AGoldberg S(2015)Eclipse attacks on Bitcoin's peer-to-peer networkProceedings of the 24th USENIX Conference on Security Symposium10.5555/2831143.2831152(129-144)Online publication date: 12-Aug-2015
https://dl.acm.org/doi/10.5555/2831143.2831152
Rupp ABaldimtsi FHinterwälder GPaar C(2015)Cryptographic Theory Meets PracticeACM Transactions on Information and System Security10.1145/269990417:3(1-31)Online publication date: 27-Mar-2015
https://dl.acm.org/doi/10.1145/2699904
Kokoschka APetrlic RSorge CWainwright RCorchado JBechini AHong J(2015)A reputation system supporting unlinkable, yet authorized expert ratingsProceedings of the 30th Annual ACM Symposium on Applied Computing10.1145/2695664.2695892(2320-2327)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1145/2695664.2695892
Kuchta VManulis M(2014)Rerandomizable Threshold Blind SignaturesRevised Selected Papers of the 6th International Conference on Trusted Systems - Volume 947310.1007/978-3-319-27998-5_5(70-89)Online publication date: 16-Dec-2014
https://dl.acm.org/doi/10.1007/978-3-319-27998-5_5
Zhu BSetia SJajodia SWang L(2010)Providing witness anonymity under peer-to-peer settingsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2010.20418215:2(324-336)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1109/TIFS.2010.2041821
Blass EKurmus AMolva RStrufe TAl-Shaer EParaboschi S(2009)PSPProceedings of the 8th ACM workshop on Privacy in the electronic society10.1145/1655188.1655196(51-60)Online publication date: 9-Nov-2009
https://dl.acm.org/doi/10.1145/1655188.1655196
Chen YSion RCarbunar BAl-Shaer EParaboschi S(2009)XPayProceedings of the 8th ACM workshop on Privacy in the electronic society10.1145/1655188.1655195(41-50)Online publication date: 9-Nov-2009
https://dl.acm.org/doi/10.1145/1655188.1655195
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents