A group key agreement protocol from pairings

Iwan Duursma, Hyang Sook Lee

Research output: Contribution to journalArticle

Abstract

We propose an n-round key agreement protocol for any N-participants, where 3n-1 < N ≤ 3n, using the tripartite Joux key agreement protocol from pairings in combination with a divide-and-conquer strategy. The security of this protocol is based on the hardness of the bilinear Diffie-Hellman problem and the computational Diffie-Hellman problem.

Original languageEnglish (US)
Pages (from-to)1451-1456
Number of pages6
JournalApplied Mathematics and Computation
Volume167
Issue number2
DOIs
StatePublished - Aug 15 2005

Keywords

  • Bilinear Diffie-Hellman problem
  • Elliptic curve cryptosystem
  • Group key agreement protocol
  • Pairings

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A group key agreement protocol from pairings'. Together they form a unique fingerprint.

  • Cite this