Encyclopedia of Wireless Networks

Living Edition
| Editors: Xuemin (Sherman) Shen, Xiaodong Lin, Kuan Zhang

Group Key Agreement for Wireless Networks

  • Tianqi ZhouEmail author
Living reference work entry
DOI: https://doi.org/10.1007/978-3-319-32903-1_315-1

Synonyms

Definitions

Group key agreement is the protocol whereby multiple parties can agree on a common key, which ensures secure information transmission in their later communication. That is, the negotiated common key can be used to encrypt message for communicating parties. Protocols that are useful in practice do not reveal the negotiated common key to any eavesdropping parties.

In wireless networks, group key agreement refers to a group of m trusted nodes that aim to agree on a common secret key K over a wireless channel. Note that the communication channel for agreeing on the common secret key K is insecure. That is, the communication channel can be controlled by an adversary. In general, there are two types of adversaries: passive adversary and active adversary.
  1. 1.

    Passive adversary: A passive adversary tries to learn information about the common secret key by eavesdropping on the communication channel.

     
  2. 2.

    Active adversary: An...

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

References

  1. Barua R, Dutta R, Sarkar P (2003) Extending jouxs protocol to multi party key agreement. In: International conference on cryptology in India. Springer, pp 205–217zbMATHGoogle Scholar
  2. Boneh D, Silverberg A (2003) Applications of multilinear forms to cryptography. Contemp Math 324(1):71–90MathSciNetCrossRefGoogle Scholar
  3. Boneh D, Zhandry M (2017) Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica 79(4):1233–1285MathSciNetCrossRefGoogle Scholar
  4. Canetti R, Krawczyk H (2001) Analysis of key-exchange protocols and their use for building secure channels. In: International conference on the theory and applications of cryptographic techniques. Springer, pp 453–474zbMATHGoogle Scholar
  5. Coron JS, Lepoint T, Tibouchi M (2013) Practical multilinear maps over the integers. In: Advances in cryptology–CRYPTO 2013. Springer, pp 476–493Google Scholar
  6. Diffie W, Hellman M (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644–654MathSciNetCrossRefGoogle Scholar
  7. Garg S, Gentry C, Halevi S (2013) Candidate multilinear maps from ideal lattices. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 1–17zbMATHGoogle Scholar
  8. Joux A (2000) A one round protocol for tripartite Diffie–Hellman. In: International algorithmic number theory symposium. Springer, pp 385–393zbMATHGoogle Scholar
  9. Shen J, Zhou T, Chen X, Li J, Susilo W (2018) Anonymous and traceable group data sharing in cloud computing. IEEE Trans Inf Forensics Secur 13(4):912–925CrossRefGoogle Scholar
  10. Steiner M, Tsudik G, Waidner M (2000) Key agreement in dynamic peer groups. IEEE Trans Parallel Distrib Syst 11(8):769–780CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of Computer and SoftwareNanjing University of Information Science & TechnologyNanjingChina

Section editors and affiliations

  • Haojin Zhu
    • 1
  • Jian Shen
    • 2
  1. 1.Shanghai Jiaotong University, ChinaShanghaiChina
  2. 2.Nanjing University of Information Science & Technology, ChinaNanjingChina