A Survey of Group Key Agreement Protocols with Constant Rounds

@article{Xiong2019ASO,
  title={A Survey of Group Key Agreement Protocols with Constant Rounds},
  author={Hu Xiong and Yan Wu and Zhenyu Lu},
  journal={ACM Comput. Surv.},
  year={2019},
  volume={52},
  pages={57:1-57:32}
}
Group key agreement (shorten as GKA) protocol enables a group of users to negotiate a one-time session key and protect the thereafter group-oriented communication with this session key across an unreliable network. The number of communication rounds is one of the main concern for practical applications where the cardinality of group participants involved is considerable. It is critical to have fixed constant rounds in GKA protocols to secure these applications. In light of overwhelming variety… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

Round-Optimal Contributory Conference Key Agreement

  • Public Key Cryptography
  • 2003
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Provably authenticated group Diffie-Hellman key exchange

  • ACM Conference on Computer and Communications Security
  • 2001
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Modelling a Public-Key Infrastructure

  • ESORICS
  • 1996
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

AD-ASGKA - authenticated dynamic protocols for asymmetric group key agreement

  • Security and Communication Networks
  • 2016
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL