A group key agreement protocol from pairings

Iwan Duursma; Hyang Sook Lee

doi:10.1016/j.amc.2004.08.011

A group key agreement protocol from pairings

Iwan Duursma, Hyang Sook Lee

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

We propose an n-round key agreement protocol for any N-participants, where 3^n-1 < N ≤ 3ⁿ, 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 language	English
Pages (from-to)	1451-1456
Number of pages	6
Journal	Applied Mathematics and Computation
Volume	167
Issue number	2
DOIs	https://doi.org/10.1016/j.amc.2004.08.011
State	Published - 15 Aug 2005

Keywords

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

Access to Document

10.1016/j.amc.2004.08.011

Cite this

@article{3dc4608f9189431ba648ba79a16c83af,

title = "A group key agreement protocol from pairings",

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.",

keywords = "Bilinear Diffie-Hellman problem, Elliptic curve cryptosystem, Group key agreement protocol, Pairings",

author = "Iwan Duursma and Lee, {Hyang Sook}",

year = "2005",

month = aug,

day = "15",

doi = "10.1016/j.amc.2004.08.011",

language = "English",

volume = "167",

pages = "1451--1456",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - A group key agreement protocol from pairings

AU - Duursma, Iwan

AU - Lee, Hyang Sook

PY - 2005/8/15

Y1 - 2005/8/15

N2 - 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.

AB - 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.

KW - Bilinear Diffie-Hellman problem

KW - Elliptic curve cryptosystem

KW - Group key agreement protocol

KW - Pairings

UR - http://www.scopus.com/inward/record.url?scp=25144470681&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2004.08.011

DO - 10.1016/j.amc.2004.08.011

M3 - Article

AN - SCOPUS:25144470681

SN - 0096-3003

VL - 167

SP - 1451

EP - 1456

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 2

ER -

A group key agreement protocol from pairings

Abstract

Keywords

Access to Document

Fingerprint

Cite this