Skip to main content
SpringerLink
Log in

Enabling Privacy Protection in E-commerce Applications

  • Conference paper
  • First Online:
Electronic Commerce (WELCOM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2232))

Included in the following conference series:

  • 743 Accesses

Abstract

Blind signatures are a cryptographic tool that is well suited to enable privacy protecting e-commerce applications. In cryptographic frameworks however, only the major cryptographic tools like digital signatures and ciphers are provided as abstract tools. Cryptographic protocols, especially blind signatures, are not available in those frameworks. We strongly believe that a modular framework is necessary for all cryptographic tools to enable the immediate replacement of an algorithm in the case of its possible breakdown. In this paper, we show how to abstract blind signatures and how to integrate them into the framework of the Java Cryptography Architecture.

This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the PhD program (Graduiertenkolleg) “Enabling Technologies for Electronic Commerce” at Darmstadt University of Technology.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abe. A secure three-move blind signature scheme for polynomially many signatures. In Advances in Cryptology — EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 136–151. Springer-Verlag, 2001.

    Chapter  Google Scholar 

  2. M. Abe and T. Okamoto. Provably secure partially blind signatures. In Advances in Cryptology — CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 271–286. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  3. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The power of RSA inversion oracles and the security of Chaum’s RSA-based blind signature scheme. In Financial Cryptography’ 1 Pre-proceedings, pages 258–277. Springer-Verlag, 2001.

    Google Scholar 

  4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security — CCS’ 93, pages 62–73. ACM Press, 1993.

    Google Scholar 

  5. D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology — CRYPTO’ 82, pages 199–203. Plenum, 1983.

    Google Scholar 

  6. J. L. Camenisch, J-M. Piveteau, and M. A. Stadler. Blind signatures based on the discrete logarithm problem. In Advances in Cryptology — EUROCRYPT’ 94, volume 950 of Lecture Notes in Computer Science, pages 428–432. Springer-Verlag, 1995.

    Chapter  Google Scholar 

  7. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469–472, 1985.

    Article  Google Scholar 

  8. A. Frier, P. Karlton, and P. Kocher. The SSL 3.0 protocol. Internet Draft, 1996.

    Google Scholar 

  9. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology — CRYPTO’ 86, volume 263 of Lecture Notes in Computer Science, pages 186–194. Springer-Verlag, 1987.

    Chapter  Google Scholar 

  10. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In 22nd Symposium on Theory of Computing-STOC’ 90, pages 416–426. ACM Press, 1990.

    Google Scholar 

  11. P. Horster, M. Michels, and H. Petersen. Meta-message recovery and meta-blind signature schemes based on the discrete logarithm problem and their applications. In Advances in Cryptology — ASIACRYPT’ 94, volume 917 of Lecture Notes in Computer Science, pages 224–237. Springer-Verlag, 1995.

    Chapter  Google Scholar 

  12. A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures. In Advances in Cryptology — CRYPTO’ 97, volume 1294 of Lecture Notes in Computer Science, pages 150–164. Springer-Verlag, 1997.

    Chapter  Google Scholar 

  13. J. Linn. Generic security service application program interface, version 2. RFC 2078, 1997.

    Google Scholar 

  14. National Institute of Standards and Technology (NIST). The Digital Signature Standard. FIPS PUB 186, 1994.

    Google Scholar 

  15. T. Okamoto and K. Otha. Divertible zero-knowledge interactive proofs and commutative random self-reduciblity. In Advances in Cryptology — EUROCRYPT’ 89, volume 434 of Lecture Notes in Computer Science, pages 134–149. Springer-Verlag, 1990.

    Google Scholar 

  16. D. Pointcheval. Strengthened security for blind signatures. InAdvances in Cryptology — EUROCRYPT’ 98, volume 1403 of Lecture Notes in Computer Science, pages 391–405. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  17. D. Pointcheval and J. Stern. Provably secure blind signature schemes. In Advances in Cryptology — ASIACRYPT’ 96, volume 1163of Lecture Notes in Computer Science, pages 252–265. Springer-Verlag, 1996.

    Chapter  Google Scholar 

  18. 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, 1978.

    Article  Google Scholar 

  19. C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161–174, 1991.

    Article  Google Scholar 

  20. C.P. Schnorr. Security of DL-encryption and signatures against generic attacks, a survey. In Public-Key Cryptography and Computational Number Theory 2000. Walter De Gruyter, 2001.

    Google Scholar 

  21. C.P. Schnorr. Security of blind discrete log signatures against interactive attacks. In 3rd International Conference On Information And Communication Security — ICICS 2001, Lecture Notes in Computer Science. Springer-Verlag, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Darmstadt University of Technology, D-64283, Darmstadt, Germany

    Dennis Kügler

Authors
  1. Dennis Kügler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Darmstadt University of Technology, Wilhelminenstr.7, 64283, Darmstadt, Germany

    Ludger Fiege  & Gero Mühl  & 

  2. T-Nova, Otto-Röhm-Str.71C, 64293, Darmstadt, Germany

    Uwe Wilhelm

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kügler, D. (2001). Enabling Privacy Protection in E-commerce Applications. In: Fiege, L., Mühl, G., Wilhelm, U. (eds) Electronic Commerce. WELCOM 2001. Lecture Notes in Computer Science, vol 2232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45598-1_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45598-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42878-7

  • Online ISBN: 978-3-540-45598-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation