Abstract
Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of logN where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit amount)), but payments divided from a coin are linkable (i.e., anyone can decide whether the payments are made by the same payer). The linked payments help anyone to trace the payer, if N is large. On the other hand, in the existing unlinkable divisible e-cash system, the protocols are conducted in the order of the polynomial of N, and thus it is inefficient for large N. In this paper, an unlinkable divisible e-cash system is proposed, where all protocols are conducted in the order of (logN)2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pfitzmann, B. and Waidner, M.: How to Break and Repair a “Provably Secure” Untraceable Payment System, Advances in Cryptology-CRYPTO’91, LNCS 576, Springer-Verlag, pp. 338–350 (1992).
Okamoto, T.: An Efficient Divisible Electronic Cash Scheme, Advances in Cryptology-CRYPTO’95, LNCS 963, Springer-Verlag, pp. 438–451 (1995).
Chan, A., Frankel, Y. and Tsiounis, Y.: Easy Come-Easy Go Divisible Cash, Advances in Cryptology-EUROCRYPT’98, LNCS 1403, Springer-Verlag, pp. 561–575 (1998).
Nakanishi, T., Haruna, N. and Sugiyama, Y.: Unlinkable Electronic Coupon Protocol with Anonymity Control, Proc. of Second International Information Security Workshop, ISW’99, LNCS 1729, Springer-Verlag, pp. 37–46 (1999).
Fujisaki, E. and Okamoto, T.: Practical Escrow Cash Schemes, IEICE trans. on Fundamentals., Vol. E81-A, No. 1, pp. 11–19 (1998).
von Solms, S. and Naccache, D.: On Blind Signatures and Perfect Crimes, Computers and Security, Vol. 11, No. 6, pp. 581–583 (1992).
Frankel, Y. D. Y.: Threshold Cryptosystems, Advances in Cryptology-CRYPTO’89, LNCS 435, Springer-Verlag, pp. 307–315 (1990).
Camenisch, J. and Stadler, M.: Efficient Group Signature Schemes for Large Groups, Advances in Cryptology-CRYPTO’97, LNCS 1294, Springer-Verlag, pp. 410–424 (1997).
Fiat, A. and Shamir, A.: How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology-CRYPTO’ 86, LNCS 263, Springer-Verlag, pp. 186–194 (1987).
Bellare, M. and Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, Proc. of First Annual Conference on Computer and Communications Security, Association for Computing Machinery, pp. 62–73 (1993).
Stadler, M.: Publicly Verifiable Secret Sharing, Advances in Cryptology-EU-ROCRYPT’96, LNCS 1070, Springer-Verlag, pp. 190–199 (1996).
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms, Advances in Cryptology-CRYPTO’84, LNCS 196, Springer-Verlag, pp. 10–18 (1985).
Chaum, D.: Blind Signatures for Untraceable Payments, Advances in Cryptology: Proceedings of CRYPTO’ 82, Plenum Press, pp. 199–203 (1983).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakanishi, T., Sugiyama, Y. (2000). Unlinkable Divisible Electronic Cash. In: Goos, G., Hartmanis, J., van Leeuwen, J., Pieprzyk, J., Seberry, J., Okamoto, E. (eds) Information Security. ISW 2000. Lecture Notes in Computer Science, vol 1975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44456-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-44456-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41416-2
Online ISBN: 978-3-540-44456-5
eBook Packages: Springer Book Archive