DDH-based group key agreement in a mobile environment

Nam, Junghyun; Lee, Jun Young; Kim, Seungjoo; Won, Dongho

doi:10.1016/j.jss.2004.10.024

Cited by 53 publications

(81 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach reduces the computational costs on mobile nodes. Consequently, several group key agreement protocols [18][19][20][21][22] for the imbalanced wireless network have been proposed.…”

Section: Introductionmentioning

confidence: 99%

“…Bresson et al [19] proposed a two-round GKE protocol for imbalanced wireless networks. Unfortunately, their protocol provides only partial forward secrecy [20]. This partial forward secrecy means that leaking the mobile nodes' private keys do not reveal any information about the previous establishment group keys, but leaking the powerful node's private key will enable an adversary to reconstruct the previous group keys.…”

Section: Introductionmentioning

confidence: 99%

“…This partial forward secrecy means that leaking the mobile nodes' private keys do not reveal any information about the previous establishment group keys, but leaking the powerful node's private key will enable an adversary to reconstruct the previous group keys. Subsequently, Nam et al [20] also presented an improvement on the protocol proposed by Bresson et al In 2007, Tseng [21] demonstrated that the Nam et al's protocol has a security weakness. In their protocol, the powerful node can pre-determine the group key.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Two-round contributory group key exchange protocol for wireless network environments

Tseng

2011

J Wireless Com Network

View full text Add to dashboard Cite

With the popularity of group-oriented applications, secure group communication has recently received much attention from cryptographic researchers. A group key exchange (GKE) protocol allows that participants cooperatively establish a group key that is used to encrypt and decrypt transmitted messages. Hence, GKE protocols can be used to provide secure group communication over a public network channel. However, most of the previously proposed GKE protocols deployed in wired networks are not fully suitable for wireless network environments with low-power computing devices. Subsequently, several GKE protocols suitable for mobile or wireless networks have been proposed. In this article, we will propose a more efficient group key exchange protocol with dynamic joining and leaving. Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we demonstrate that the proposed protocol is secure against passive attack and provides forward/backward secrecy for dynamic member joining/leaving. As compared with the recently proposed GKE protocols, our protocol provides better performance in terms of computational cost, round number, and communication cost.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Two-round contributory group key exchange protocol for wireless network environments

Tseng

2011

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Augot, Bhaskar, Issarny, Sacchetti (2005) proposed two rounds group key agreement based on decisional Diffie-Hellman assumption to secure against a passive adversary and extended into three rounds to secure against an active adversary. The protocol what secures against active adversary and satisfies perfect forward secrecy under decisional Diffie-Hellman assumption was proposed by Nam, Lee, Kim, and Won (2005). The amount of computation is fixed for mobile participants due to the server with sufficient computation power that assumed to environment is responsibility for most of computations.…”

mentioning

confidence: 99%

Efficient Group Key Agreement on Tree-based Braid Groups

Aneksrup¹,

Hiranvanichakorn

2010

CIS

View full text Add to dashboard Cite

The security issues in ad hoc network are increasingly important. In this paper, we propose a distributed key management what approach by using braid groups and key tree. Without any assumption of prefixed trust relationship between nodes, the proposed method works in a self-organizing way to provide the key management services. The using of the proposed tree-based braid groups has following advantages: (1) the communication cost is minimized to constant time; (2) the complexity of computation is decreased to linear permutation by avoiding modular exponential operation. Our approach is more simple, secure and efficiency for group key management in MANET.

show abstract

“…We propose a provably secure and efficient protocol which achieves perfect forward secrecy as well. Subsequent to our work, Won et al [9] also solve this problem but their proposition turns out to be expensive computationally. In table 1, the number of exponentiations per member for our protocol are compared with some well-known protocols (including maximum number of exponentiations by any member for asymmetric protocols).…”

Section: Related Workmentioning

confidence: 99%