Simple and efficient group key agreement based on factoring

Junghyun Nam, Seokhyang Cho, Seung-Joo Kim, Dongho Won

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Group key agreement protocols are designed to allow a group of parties communicating over a public network to agree on a session key in a secure manner. While a number of solutions have been proposed over the years, all of them are inadequate for a group where members are spread across a wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of messages sent, both of which are recognized as the dominant factors that severely slow down the protocols in wide area networks. In this paper we first present a communication-efficient group key agreement protocol and then prove its security against a passive adversary in the random oracle model under the factoring intractability assumption. The proposed protocol provides perfect forward secrecy and runs only in two communication rounds while achieving optimal message complexity. Therefore, the protocol is well suited for networking environments with high communication latency.

Original languageEnglish
Pages (from-to)645-654
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3043
Publication statusPublished - 2004 Dec 1
Externally publishedYes

Fingerprint

Group Key Agreement
Factoring
Communication
Network protocols
Key Agreement Protocol
Wide area networks
Message Complexity
Random Oracle Model
Confidentiality
Number of Solutions
Networking
Latency

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Simple and efficient group key agreement based on factoring. / Nam, Junghyun; Cho, Seokhyang; Kim, Seung-Joo; Won, Dongho.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3043, 01.12.2004, p. 645-654.

Research output: Contribution to journalArticle

@article{60164d5545ae4ddd833e81aad699ee00,
title = "Simple and efficient group key agreement based on factoring",
abstract = "Group key agreement protocols are designed to allow a group of parties communicating over a public network to agree on a session key in a secure manner. While a number of solutions have been proposed over the years, all of them are inadequate for a group where members are spread across a wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of messages sent, both of which are recognized as the dominant factors that severely slow down the protocols in wide area networks. In this paper we first present a communication-efficient group key agreement protocol and then prove its security against a passive adversary in the random oracle model under the factoring intractability assumption. The proposed protocol provides perfect forward secrecy and runs only in two communication rounds while achieving optimal message complexity. Therefore, the protocol is well suited for networking environments with high communication latency.",
author = "Junghyun Nam and Seokhyang Cho and Seung-Joo Kim and Dongho Won",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3043",
pages = "645--654",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Simple and efficient group key agreement based on factoring

AU - Nam, Junghyun

AU - Cho, Seokhyang

AU - Kim, Seung-Joo

AU - Won, Dongho

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Group key agreement protocols are designed to allow a group of parties communicating over a public network to agree on a session key in a secure manner. While a number of solutions have been proposed over the years, all of them are inadequate for a group where members are spread across a wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of messages sent, both of which are recognized as the dominant factors that severely slow down the protocols in wide area networks. In this paper we first present a communication-efficient group key agreement protocol and then prove its security against a passive adversary in the random oracle model under the factoring intractability assumption. The proposed protocol provides perfect forward secrecy and runs only in two communication rounds while achieving optimal message complexity. Therefore, the protocol is well suited for networking environments with high communication latency.

AB - Group key agreement protocols are designed to allow a group of parties communicating over a public network to agree on a session key in a secure manner. While a number of solutions have been proposed over the years, all of them are inadequate for a group where members are spread across a wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of messages sent, both of which are recognized as the dominant factors that severely slow down the protocols in wide area networks. In this paper we first present a communication-efficient group key agreement protocol and then prove its security against a passive adversary in the random oracle model under the factoring intractability assumption. The proposed protocol provides perfect forward secrecy and runs only in two communication rounds while achieving optimal message complexity. Therefore, the protocol is well suited for networking environments with high communication latency.

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

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

M3 - Article

AN - SCOPUS:35048892094

VL - 3043

SP - 645

EP - 654

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -