ACISP 1999: Information Security and Privacy pp 244-257 | Cite as
Effient Electronic Cash Using Batch Signatures
Conference paper
First Online:
Abstract
All known anonymous electronic cash protocols are inefficient compared to other electronic payment protocols. This is because much of the complexity of the protocols is devoted to ensuring the anonymity of the consumer. This problem is addressed with an extension of Brands’ electronic cash payment protocol using batch cryptography. Batch signature generation is used to improve the efficiency of the withdrawal process so that multiple coins can be withdrawn for almost the cost of only one Brands’ coin withdrawal. As a consequence coins withdrawn together can be linked. Batch verification is also used to increase the efficiency of payment. We show that the security of the original scheme is maintained and the level of privacy provided by the cash scheme can be determined by the customer.
Keywords
Signature Scheme Blind Signature Modular Exponentiation Electronic Payment Payment Protocol
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Mihir Bellare, Juan A. Garay, and Tal Rabin. Fast Batch Verification for Modular Exponentiation and Digital Signatures. In Advances in Cryptology-Proceedings of EUROCRYPT’ 98, volume 1403 of Lecture Notes in Computer Science. Springer-Verlag, 1998.Google Scholar
- 2.Jean-Paul Boly, Antoon Bosselaers, Ronald Cramer, Rolf Michelsen, Stig Mjolsnes, Frank Muller, Torben Pedersen, Birgit Pfitzmann, Peter de Rooij, Berry Schoenmakers, Matthias Schunter, Luc Vallee, and Michael Waidner. The ESPRIT Project CAFE-High Security Digital Payment Systems. In Computer Security-ESORICS’ 94, pages 217–230. Springer-Verlag, 1994.Google Scholar
- 3.Stefan Brands. Untraceable Off-line Cash in Wallets with Observers. In Advances in Cryptology-Proceedings of CRYPTO’ 93, volume 773 of Lecture Notes in Computer Science, pages 302–318. Springer-Verlag, 1993.Google Scholar
- 4.Jan Camenisch, Ueli Maurer, and Markus Stadler. Digital Payment Systems with Passive Anonymity-Revoking Trustees. In Proceedings of ESORICS’ 96, volume 1146 of Lecture Notes in Computer Science, pages 33–34. Springer-Verlag, 1996.Google Scholar
- 5.Agnes Chan, Yair Frankel, and Yiannis Tsiounis. Easy Come-Easy Go Divisible Cash. In Advances in Cryptology-Proceedings of EUROCRYPT’ 98, volume 1403 of Lecture Notes in Computer Science, pages 561–575. Springer-Verlag, May 1998.CrossRefGoogle Scholar
- 6.David Chaum. Blind Signatures for Untraceable Payments. In Advances in Cryptology-Proceedings of CRYPTO’ 82, pages 199–203. Plenum Press, 1983.Google Scholar
- 7.David Chaum, Amos Fiat, and Moni Naor. Untraceable Electronic Cash. In Advances in Cryptology-Proceedings of CRYPTO’ 88, Lecture Notes in Computer Science, pages 319–327. Springer-Verlag, 1990.Google Scholar
- 8.Aymeric de Solanges and Jacques Traore. An Efficient Fair Off-line Electronic Cash System with Extensions to Checks and Wallets with Observers. In Fincancial Cryptography’ 98, Lecture Notes in Computer Science. Springer-Verlag, Feb 1998.Google Scholar
- 9.Tony Eng and Tatsuaki Okamoto. Single-Term Divisible Electronic Coins. In Advances in Cryptology-Proceedings of EUROCRYPT’ 94, number 950 in Lecture Notes in Computer Science, pages 306–319. Springer-Verlag, 1994.CrossRefGoogle Scholar
- 10.Niels Ferguson. Extensions of Single Term Coins. In Advances in Cryptology-Proceedings of CRYPTO’ 93, volume 773 of Lecture Notes in Computer Science, pages 292–301. Springer-Verlag, 1993.Google Scholar
- 11.Niels Ferguson. Single Term Off-Line Coins. In Advances in Cryptology-Proceedings of EUROCRYPT’ 93, pages 318–328. Springer-Verlag, 1994.Google Scholar
- 12.Amos Fiat. Batch RSA. In Advances in Cryptology-Proceedings of CRYPTO’ 89, volume 435 of Lecture Notes in Computer Science, pages 175–185. Springer-Verlag, 1990.CrossRefGoogle Scholar
- 13.Yair Frankel, Yiannis Tsiounis, and Moti Yung. Indirect Discourse Proofs: Achieving Efficient Fair Off-Line E-Cash. In Advances in Cryptology-Proceedings of ASIACRYPT’ 96, pages 286–300. Springer-Verlag, 1996.Google Scholar
- 14.Matthew Franklin and Moti Yung. Secure and Efficient Off-Line Digital Money. In Proceedings of ICALP’ 93, number 700 in Lecture Notes in Computer Science, pages 265–276. Springer-Verlag, 1993.Google Scholar
- 15.L. Harn. Batch Verifying Multiple RSA Digital Signatures. Electronic Letters, 34(12):1219–1220, June 1998.CrossRefGoogle Scholar
- 16.Barry Hayes. Anonymous One-Time Signatures and Flexible Untraceable Electronic Cash. In Advances in Cryptology-AUSCRYPT’ 90, pages 294–305. Springer-Verlag, 1990.Google Scholar
- 17.Markus Jakobsson and Moti Yung. Revokable and Versatile Electronic Money. In Third ACM Conference on Computer and Communications Security, pages 76–87. ACM Press, 1996.Google Scholar
- 18.Khanh Quoc Nguyen, Yi Mu, and Vijay Varadharajan. One-Response Off-line Digital Coins. In The Workshop Records of SAC’ 97, Aug 1997.Google Scholar
- 19.Tatsuaki Okamoto. An Efficient Divisible Electronic Cash Scheme. In Advances in Cryptology-Proceedings of CRYPTO’ 95, pages 438–451. Springer-Verlag, 1995.Google Scholar
- 20.Tatsuaki Okamoto and Kazuo Ohta. Universal Electronic Cash. In Advances in Cryptology-Proceedings of CRYPTO’ 91, pages 324–337. Springer-Verlag, 1992.Google Scholar
- 21.D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In U. Maurer, editor, Advances in Cryptology Proceedings of EUROCRYPT’ 96, Lecture Notes in Computer Science, pages 387–398, Zaragoza, Spain, May 1996. Springer-Verlag.Google Scholar
- 22.Claus-Peter Schnorr. Efficient Signature Generation for Smart Cards. In Advances in Cryptology-Proceedings of CRYPTO’ 89, pages 239–252. Springer-Verlag, 1990.Google Scholar
- 23.Sung-Ming Yen and Chi-Sung Laih. Improved Digital Signature Suitable for Batch Verification. In IEEE Transactions on Computers, volume 44, pages 957–959, Jul 1995.MATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1999