Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Systems and Software

DDH-based group key agreement in a mobile environment

Junghyun Nam, Jinwoo Lee, Seungjoo Kim, Dongho Won

Published Dec 9, 2004• 59 citations
Publisher
DOI
10.1016/j.jss.2004.10.024

Related papers

A new authenticated group key agreement in a mobile environment

Cheng‐Chi Lee, Tsung‐Hung Lin, Chwei‐Shyong Tsai

Annals of Telecommunications•Apr 17, 2009•43 citations

A novel authenticated group key agreement protocol for mobile environment

Jia‐Lun Tsai

Annals of Telecommunications•Mar 2, 2011•16 citations

DDH-based Group Key Agreement in a Mobile Environment.

Junghyun Nam, Jinwoo Lee, Seungjoo Kim +1 more

A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the Decisional Diffie-Hellman assumption. The protocol meets simplicity, efficiency, and all the desired security properties.

•Jan 1, 2004•0 citations

DDH-based Group Key Agreement for Mobile Computing

Junghyun Nam, Jinwoo Lee, Seungjoo Kim +1 more

A group key agreement protocol is designed to e#ciently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the Decisional Di#e-Hellman assumption. The protocol meets simplicity, e#ciency, and all the desired security properties.

•Jan 1, 2004•6 citations

A Framework for Robust Group Key Agreement

Jens-Matthias Bohli

Lecture notes in computer science•Jan 1, 2006•27 citations

Dynamic Group Key Agreement in Tree-Based Setting

Ratna Dutta, Rana Barua

Lecture notes in computer science•Jan 1, 2005•48 citations
A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the Decisional Diffie-Hellman assumption. The protocol meets simplicity, efficiency, and all the desired security properties.
A group key agreement protocol is designed to e#ciently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the Decisional Di#e-Hellman assumption. The protocol meets simplicity, e#ciency, and all the desired security properties.