Abstract
In this paper, we introduce a new electronic money methodology: sub-contracting the blinding to a trustee and using an Identity-based piece of information to achieve provable privacy and security. This variation on the Brickel, Gemmel and Kravitz paradigm [2] offers protection against various attacks minimizing user's computational requirement. Furthermore, our scheme offers various complexity/privacy tradeoffs without endangering the issuer's overall security.
Preview
Unable to display preview. Download preview PDF.
References
S. Brands, ”Untraceable Off-line Cash in Wallet with Observers”, Advances in Cryptology — CRYPTO '93, LNCS 773, pp. 302–318.
E. Brickell, P. Gemmel and D. Kravitz, ”Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonimous Change”, Proceedings of 6th. annual Symposium on Discrete Algorithm (SODA), 1995, ACM Press, pp. 457–466.
J. Cammenish, J-M. Piveteau and M. Stadler, ”An Efficient Fair Payment System”, Third ACM Conference on Computer and Communications Security, 1996, ACM Press, pp. 88–94.
D. Chaum, ”Blind Signatures for Untraceable Payments”, Advances in Cryptology — Proceedings of Crypto 82, Plenum, NY, pp. 199–203.
D. Chaum, A. Fiat and M. Naor, ”Untraceable Electronic Cash”, Advances in Cryptology — CRYPTO '88, LNCS 403, pp. 318–327.
W. Diffie and M. Hellman, ”New Directions in Cryptography”, IEEE Tans. Info. Theory IT-22, Nov. 1976, pp. 644–654.
N. Ferguson, ”Extensions of Single Term Coins”, Advances in Cryptology — CRYPTO '93, LNCS 773, pp. 292–301.
FIPS PUB 186, February 1, 1993, Digital Signature Standard.
M. Jakobsson and M. Yung, ”Revokable and Versatile Electronic Money”, Third ACM Conference on Computer and Communications Security, 1996, ACM Press, pp. 76–87.
D. Naccache, D. M'Raïhi, S. Vaudenay and D. Raphaeli, ”Can DSA be improved?-Complexity trade-offs with the Digital Signature Standard”, Advances in Cryptology — EUROCRYPT '94, LNCS 950, pp. 77–85.
D. Pointcheval, J. Stern, ”Security Proofs for Signature Schemes”, Advances in Cryptology — EUROCRYPT '96, LNCS 1070 pp. 387–398.
R. Rivest, A. Shamir and L. Adleman, ”A method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communications of the ACM, v. 21, n. 2, Feb 1978, pp. 120–126.
C. Schnorr, ”Efficient identification and signatures for smart-cards”, Advances in Cryptology — EUROCRYPT '89, LNCS 765, pp. 435–439.
S. von Solms and D. Naccache, ”On Blind Signatures and Perfect Crimes”, Computers and Security, 11 (1992) pp. 581–583.
M. Stadler, J-M. Piveteau and J. Cammenish, ”Fair Blind Signatures”, Advances in Cryptology — EUROCRYPT '95, LNCS 921, pp. 209–219.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
M'Raïhi, D. (1996). Cost-effective payment schemes with privacy regulation. In: Kim, K., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '96. ASIACRYPT 1996. Lecture Notes in Computer Science, vol 1163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034853
Download citation
DOI: https://doi.org/10.1007/BFb0034853
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61872-0
Online ISBN: 978-3-540-70707-3
eBook Packages: Springer Book Archive