Skip to main content

The Diffie–Hellman Problem in Lie Algebras

  • Conference paper
  • 1245 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4585))

Abstract

Cryptography in its present state relies increasingly on complex mathematical theories, e.g., elliptic curves, group theory, etc. We address in this article the problem of proxy signatures and we set this problem in the framework of Lie algebras. We show how to use a chosen maximal set of differentiable automorphisms in order to carry out the task of proxy signing. We also show possible attacks and the way to protect against them.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mahalanobis, A.: Diffie-Hellman key exchange protocol and non-abelian nilpotent groups (2005), http://eprint.iacr.org/2005/110.ps

  2. Koblitz, N.: Algebraiczne aspekty kryptografii, WNT, Warszawa (2000)

    Google Scholar 

  3. Wojtyñski, W.: Grupy i algebry Liego. PWN, Warszawa (1986)

    Google Scholar 

  4. Pomykaa, J., Barabasz, S.: Eliptic Curve Based Threshold Proxy Signature Scheme with Known Signers. Fundamenta Informaticae 69(4), 411–425 (2006)

    MathSciNet  Google Scholar 

  5. Goldwasser, S., Bellare, M.: Lecture Notes on Cryptography (1996) http://www-cse.ucsd.edu/~mihir/papers/gb.html

  6. Desmedt, I.: Some Recent Research Aspect of Threshold Cryptography, Departament of Mathematics Royal Holloway University of London (1997) http://citeseer.ist.psu.edu/desmedt97some.html

  7. Zhang, K.: Threshold Proxy Signature Schemes, Cambridge University Computer Laboratory (1997) http://citeseer.ist.psu.edu/zhang97threshold.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marzena Kryszkiewicz James F. Peters Henryk Rybinski Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rafalska, B. (2007). The Diffie–Hellman Problem in Lie Algebras. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds) Rough Sets and Intelligent Systems Paradigms. RSEISP 2007. Lecture Notes in Computer Science(), vol 4585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73451-2_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73451-2_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73450-5

  • Online ISBN: 978-3-540-73451-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics