Distributed Trustees and revocability: A framework for internet payment

  • David M'RaÏhi
  • David Pointcheval
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1465)


From von Solms and Naccache's standpoint, constructing a practical and secure e-money system implies a proper regulation of its privacy level. Furthermore, when the system benefits from a widely connected communication network, tuning precisely this control for achieving efficiency without endangering security is a hard task. In order to solve this specific problem, we propose an e-cash scheme based on the usage of provably secure primitives, where trustee quora are in charge of privacy control. Moreover, Trustees remain off-line throughout the e-coin's life to reduce the communication flow and improve the resulting scheme performance.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. A. Brands. Untraceable Off-line Cash in Wallets with Observers. In Crypto '93, LNCS 773, pages 302–318. Springer-Verlag, 1994.Google Scholar
  2. 2.
    E. Brickell, P. Gemmell, and D. Kravitz. Trustee-based Tracing Extensions to Anonymous Cash and Making of Anonymous Change. In SODA '95, pages 457–466, 1995.Google Scholar
  3. 3.
    J. Camenisch, U. Maurer, and M. Stadler. Digital Payment Systems with Passive Anonymity-Revoking Trustees. In ESORICS '96, LNCS 1146. Springer-Verlag, 1996.Google Scholar
  4. 4.
    J. Camenisch, J.-M. Piveteau, and M. Stadler. Fair Blind Signatures. In Eurocrypt '95, LNCS 921, pages 209–219. Springer-Verlag, 1995.Google Scholar
  5. 5.
    J. Camenisch, J.-M. Piveteau, and M. Stadler. An Efficient Fair Payment System. In Proc. of the 3rd CCCS, pages 88–94. ACM press, 1996.Google Scholar
  6. 6.
    D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84–88, February 1981.CrossRefGoogle Scholar
  7. 7.
    D. Chaum. Blind Signatures for Untraceable Payments. In Crypto '82, pages 199–203. Plenum, NY, 1983.Google Scholar
  8. 8.
    D. Chaum, A. Fiat, and M. Naor. Untraceable Electronic Cash. In Crypto '88, LNCS 403, pages 319–327. Springer-Verlag, 1989.Google Scholar
  9. 9.
    W. Diffie and M. E. Hellman. New Directions in Cryptography. In IEEE Transactions on Information Theory, volume IT-22, no. 6, pages 644–654, november 1976.MathSciNetCrossRefGoogle Scholar
  10. 10.
    N. Ferguson. Extensions of Single Term Coins. In Crypto '93, LNCS 773, pages 292–301. Springer-Verlag, 1994.Google Scholar
  11. 11.
    Y. Frankel, Y. Tsiounis, and M. Yung. “Indirect Disclosure Proof”: Achieving Efficient Fair Off-Line E-Cash. In Asiacrypt '96, LNCS 1163, pages 286–300. Springer-Verlag, 1996.Google Scholar
  12. 12.
    T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In IEEE Transactions on Information Theory, volume IT-31, no. 4, pages 469–472, july 1985.Google Scholar
  13. 13.
    M. Jakobsson and M. Yung. Revokable and Versatile Electronic Money. In Proc. of the 3rd CCCS, pages 76–87. ACM press, 1996.Google Scholar
  14. 14.
    M. Jakobsson and M. Yung. Distributed “Magic Ink” Signatures. In Eurocrypt '97, LNCS 1233, pages 450–464. Springer-Verlag, 1997.Google Scholar
  15. 15.
    M. Jakobsson and M. Yung. Applying Anti-Trust Policies to Increase Trust in a Versatile e-money System. In Financial Cryptography '97, LNCS 1318. Springer-Verlag, 1998.Google Scholar
  16. 16.
    U. M. Maurer. Diffie Hellman Oracles. In Crypto '96, LNCS 1109, pages 268–282. Springer-Verlag, 1996.Google Scholar
  17. 17.
    D. M'RaÏhi. Cost-Effective Payment Schemes with Privacy Regulation. In Asiacrypt '96, LNCS 1163, pages 266–275. Springer-Verlag, 1996.Google Scholar
  18. 18.
    T. Okamoto. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. In Crypto '92, LNCS 740, pages 31–53. Springer-Verlag, 1992.Google Scholar
  19. 19.
    H. Petersen and G. Poupard. Efficient Scalable Fair Cash with Off-line Extortion Prevention. In Proc. of ICICS'97, LNCS 1334, pages 463–477. Springer-Verlag, 1997.Google Scholar
  20. 20.
    D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In Eurocrypt '96, LNCS 1070, pages 387–398. Springer-Verlag, 1996.Google Scholar
  21. 21.
    D. Pointcheval and J. Stern. Provably Secure Blind Signature Schemes. In Asiacrypt '96, LNCS 1163, pages 252–265. Springer-Verlag, 1996.Google Scholar
  22. 22.
    R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 21 (2): 120–126, february 1978.MATHMathSciNetCrossRefGoogle Scholar
  23. 23.
    C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto '89, LNCS 435, pages 235–251. Springer-Verlag, 1990.Google Scholar
  24. 24.
    C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161–174, 1991.MATHMathSciNetCrossRefGoogle Scholar
  25. 25.
    V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Eurocrypt '97, LNCS 1233, pages 256–266. Springer-Verlag, 1997.Google Scholar
  26. 26.
    S. von Solms and D. Naccache. On Blind Signatures and Perfect Crimes. Computers & Security, 11:581–583, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • David M'RaÏhi
    • 1
  • David Pointcheval
    • 2
    • 3
  1. 1.Cryptography DepartmentGEMPLUSIssy-les-Mou-lineauxFrance
  2. 2.GREYCUniversité de CaenCaen CedexFrance
  3. 3.école Normale SupérieureLIENSParis Cedex 05France

Personalised recommendations