Article

Micropayments Revisited

Authors:

Ronald L. RivestAuthors Info & Claims

CT-RSA '02: Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology

Pages 149 - 163

Published: 18 February 2002 Publication History

Abstract

We present new micropayment schemes that are more efficient and user friendly than previous ones.These schemes reduce bank processing costs by several orders of magnitude, while preserving a simple interface for both users and merchants. The schemes utilize a probabilistic deposit protocol that, in some of the schemes, may be entirely hidden from the users.

References

[1]

W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr. Rsa/rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing , 17(2):194-209, June 13 1988.

[2]

Ross Anderson, Harry Manifavas, and Chris Sutherland. NetCard - A practical electronic cash system. In Proceedings Fourth Cambridge Workshop on Security Protocols , volume 1189 of Lecture Notes in Computer Science . Springer, 1996.

[3]

Shimon Even, Oded Goldreich, and Silvio Micali. On-line/off-line digital signatures. In Gilles Brassard, editor, Advances in Cryptology - Crypto '89 , pages 263- 277, Berlin, 1989. Springer-Verlag. Lecture Notes in Computer Science Volume 435.

[4]

Phillip Hallam-Baker. W3C payments resources, 1995. http://www.w3.org/hypertext/WWW/Payments/overview.html.

[5]

Ralf Hauser, Michael Steiner, and Michael Waidner. Micro-payments based on iKP. Technical Report 2791 (# 89269), June 1996.

[6]

Stanislaw Jarecki and Andrew Odlyzko. An efficient micropayment scheme based on probabilistic polling. In Proceedings 1997 Financial Cryptography Conference , volume 1318 of Lecture Notes in Computer Science , pages 173-191, Springer, 1997.

[7]

Charanjit Jutla and Moti Yung. PayTree: "amortized-signature" for flexible MicroPayments. In Proceedings of the Second USENIX Workshop on Electronic Commerce , pages 213-221. USENIX, 1996.

[8]

Laurie Law, Susan Sabett, and Jerry Solinas. How to make a mint: the cryptography of anonymous electronic cash. National Security Agency, Office of Information Security Research and Technology, Cryptology Division, June 1996.

[9]

Richard J. Lipton and Rafail Ostrovsky. Micro-payments via efficient coin-flipping. In Proceedings of Second Financial Cryptography Conference, '98 , volume 1465 of Lecture Notes in Computer Science LNCS , pages 1-15, February 1998.

[10]

Mark S. Manasse. Millicent (electronic microcommerce), 1995. http://www.research.digital.com/SRC/personal/Mark_Manasse/uncommon/ ucom.html.

[11]

S. Micali, M. Rabin, and S. Vadhan. Verifiable random functions. In Proc . 40th Symp. on Foundations of Computer Science , pages 120-130, October 1999.

[12]

Silvio Micali. Certified e-mail with invisible post offices. In Proceedings RSA97, San Francisco, CA, January 1997. Also, U.S. Patent No. 5,666,420.

[13]

Silvio Micali. Efficient certificate revocation. In Proceedings RSA97, San Francisco, CA, January 1997. Also U.S. Patent No. 5,666,416.

[14]

Torben P. Pedersen. Electronic payments of small amounts. Technical Report DAIMI PB-495, Aarhus University, Computer Science Department, Århus, Denmark, August 1995.

[15]

Ronald L. Rivest. Electronic lottery tickets as micropayments. In Proceedings of Financial Cryptography '97 , volume 1318 of Lecture Notes in Computer Science , pages 307-314. Springer, 1997. (Available as http://theory.lcs.mit.edu/~rivest/lottery.pdf).

[16]

Ronald L. Rivest and Adi Shamir. PayWord and MicroMint-two simple micropayment schemes. In Mark Lomas, editor, Proceedings of 1996 International Workshop on Security Protocols , volume 1189 of Lecture Notes in Computer Science , pages 69-87. Springer, 1997. (Also available in Crypto-Bytes, volume 2, number 1 (RSA Laboratories, Spring 1996), 7-11, and at http://theory.lcs.mit.edu/~rivest/RivestShamir-mpay.pdf).

[17]

Adi Shamir, 2001. Personal communication.

[18]

W3C. Micropayments overview. http://www.w3.org/ECommerce/Micropayments/.

[19]

David Wheeler. Transactions using bets. In Mark Lomas, editor, Security Protocols , volume 1189 of Lecture Notes in Computer Science , pages 89-92. Springer, 1996. (Also available by ftp from the server ftp.cl.cam.ac.ukas/users/djw3/tub.ps.).

Cited By

Abe MCamenisch JDowsley RDubovitskaya M(2019)On the Impossibility of Structure-Preserving Deterministic PrimitivesJournal of Cryptology10.1007/s00145-018-9292-132:1(239-264)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00145-018-9292-1
Dziembowski SFaust SHostáková KLie DMannan MBackes MWang X(2018)General State Channel NetworksProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security10.1145/3243734.3243856(949-966)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3243734.3243856
Lauer SEmura KHong Seo JWatanabe Y(2018)On Several Verifiable Random Functions and the q-decisional Bilinear Diffie-Hellman Inversion AssumptionProceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop10.1145/3197507.3197515(45-51)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3197507.3197515
Show More Cited By

Recommendations

Probabilistic Micropayments with Transferability
Computer Security – ESORICS 2021
Abstract
Micropayments are one of the challenges in cryptocurrencies. The problems in realizing micropayments in the blockchain are the low throughput and the high blockchain transaction fee. As a solution, decentralized probabilistic micropayment has been ...
Micropayments for Decentralized Currencies
CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security

Electronic financial transactions in the US, even those enabled by Bitcoin, have relatively high transaction costs. As a result, it becomes infeasible to make micropayments, i.e. payments that are pennies or fractions of a penny. In order to circumvent ...
MicroCash: Practical Concurrent Processing of Micropayments
Financial Cryptography and Data Security
Abstract
Micropayments have a large number of potential applications. However, processing these small payments individually can be expensive, with transaction fees often exceeding the payment value itself. By aggregating the small transactions into a few ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

CT-RSA '02: Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology

February 2002

309 pages

ISBN:3540432248

Editor:
Bart Preneel

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 February 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
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

Abe MCamenisch JDowsley RDubovitskaya M(2019)On the Impossibility of Structure-Preserving Deterministic PrimitivesJournal of Cryptology10.1007/s00145-018-9292-132:1(239-264)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00145-018-9292-1
Dziembowski SFaust SHostáková KLie DMannan MBackes MWang X(2018)General State Channel NetworksProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security10.1145/3243734.3243856(949-966)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3243734.3243856
Lauer SEmura KHong Seo JWatanabe Y(2018)On Several Verifiable Random Functions and the q-decisional Bilinear Diffie-Hellman Inversion AssumptionProceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop10.1145/3197507.3197515(45-51)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3197507.3197515
Drosatos GTasidou AEfraimidis P(2017)Privacy-Enhanced Television Audience MeasurementsACM Transactions on Internet Technology10.1145/300996917:1(1-29)Online publication date: 25-Feb-2017
https://dl.acm.org/doi/10.1145/3009969
Liu YZhao QLiu GChang LShen J(2017)A Fairness-Enhanced Micropayment SchemeWireless Personal Communications: An International Journal10.1007/s11277-016-3740-896:4(5267-5278)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s11277-016-3740-8
Green MLadd WMiers IWeippl EKatzenbeisser SKruegel CMyers AHalevi S(2016)A Protocol for Privately Reporting Ad Impressions at ScaleProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security10.1145/2976749.2978407(1591-1601)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2976749.2978407
Hofheinz DJager T(2016)Verifiable Random Functions from Standard AssumptionsProceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 956210.1007/978-3-662-49096-9_14(336-362)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.1007/978-3-662-49096-9_14
Pass Rshelat aRay ILi NKruegel C(2015)Micropayments for Decentralized CurrenciesProceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security10.1145/2810103.2813713(207-218)Online publication date: 12-Oct-2015
https://dl.acm.org/doi/10.1145/2810103.2813713
Ardagna CJajodia SSamarati PStavrou A(2013)Providing Users’ Anonymity in Mobile Hybrid NetworksACM Transactions on Internet Technology10.1145/2461321.246132212:3(1-33)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1145/2461321.2461322
Kurosawa KNojima RPhong L(2012)Relation between verifiable random functions and convertible undeniable signatures, and new constructionsProceedings of the 17th Australasian conference on Information Security and Privacy10.1007/978-3-642-31448-3_18(235-246)Online publication date: 9-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31448-3_18
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