Skip to main content
SpringerLink
Log in

On key agreement and conference key agreement

  • Security Protocols And Key Management
  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 1997)

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

Included in the following conference series:

Abstract

An attack is demonstrated on a previously proposed class of key agreement protocols. Analysis of the attack reveals that a small change in the construction of the protocols is sufficient to prevent the attack. The insight gained allows a generalisation of the class to a new design for conference key agreement protocols.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Bakhtiari, R. Safavi-Naini and J. Pieprzyk, “Keyed Hash Functons, Cryptography: Policy and Algorithms, Springer-Verlag, LNCS 1029, pp.210–214, 1996.

    Google Scholar 

  2. T. Berson, L. Gong and M. Lomas, “Secure, Keyed and Collisionful Hash Function”, Technical Report, SRI International, September 1994.

    Google Scholar 

  3. C. Boyd, “Towards a Classification of Key Agreement Protocols”, IEEE Computer Security Foundations Workshop, pp.38–43, IEEE Press 1995.

    Google Scholar 

  4. M. Burmester and Y. Desmedt, “A Secure and Efficient Conference Key Distribution System”, Advances in Cryptology — Eurocrypt 94, Springer-Verlag, 1995, pp.275–286.

    Google Scholar 

  5. W. Diffie and M. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, IT-22, 6, pp. 644–654, 1976.

    Article  Google Scholar 

  6. I. Ingemarsson, D. Tang and C. Wong, “A Conference Key Distribution Scheme”, IEEE Transactions on Information Theory, IT-28, 5, September 1982, pp. 714–720.

    Article  Google Scholar 

  7. M. Just and S. Vaudenay, “Authenticated Multi-Party Key Agreement”, Advances in Cryptology — Asiacrypt 96, Springer-Verlag, 1996, pp.26–35.

    Google Scholar 

  8. B. Klein, M. Otten and T. Beth, “Conference Key Distribution Protocols in Distributed Systems”, Codes and Cyphers — Cryptography and Coding IV, IMA, 1995, pp.225–242.

    Google Scholar 

  9. B. Preneel and P. van Oorschot, “MDx-MAC and Building Fast MACs from Hash Functions”, Advances in Cryptology — Crypto '95, Springer-Verlag, 1995, pp.1–14.

    Google Scholar 

  10. M. Rabin, “Digitalized Signatures and Public-Key Functions as Intractable as Factorization”, MIT Laboratory for Computer Science, 1979.

    Google Scholar 

  11. R. Rueppel and P. van Oorschot, “Modern Key Agreement Techniques”, Computer Communications, July 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, 2 George Street, 4001, Brisbane Q, Australia

    Colin Boyd

Authors
  1. Colin Boyd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vijay Varadharajan Josef Pieprzyk Yi Mu

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boyd, C. (1997). On key agreement and conference key agreement. In: Varadharajan, V., Pieprzyk, J., Mu, Y. (eds) Information Security and Privacy. ACISP 1997. Lecture Notes in Computer Science, vol 1270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027936

Download citation

  • DOI: https://doi.org/10.1007/BFb0027936

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63232-0

  • Online ISBN: 978-3-540-69237-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation