Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting

Dutta, Ratna; Barua, Rana

doi:10.1109/tit.2008.920224

Cited by 96 publications

(86 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we choose the unauthenticated group key agreement protocol (UDB) proposed by Dutta and Barua [Dutta and Barua 2008] as a primitive. It is based on DiffieHellman (DH) key agreement and is provably secure, and only requires 2 rounds of communication.…”

Section: Group Key Agreement Schemementioning

confidence: 99%

“…In PDP, the only information sent over the wireless channel for the derivation of K AB is the set of the X i s. Thus, key secrecy with a passive adversary amounts to that of Diffie-Hellman key exchange, which follows from the assumption that the Decisional Diffie-Hellman (DDH) problem is intractable. In the GDP protocol, a similar passive secrecy guarantee follows from the secrecy of the UDB key agreement protocol [Dutta and Barua 2008].…”

Section: Security Analysismentioning

confidence: 99%

See 1 more Smart Citation

Secure ad hoc trust initialization and key management in wireless body area networks

Guttman

et al. 2013

ACM Trans. Sen. Netw.

102

View full text Add to dashboard Cite

Body area network (BAN) is a key enabling technology in E-healthcare. An important security issue is to establish initial trust relationship among the BAN devices before they are actually deployed, and generate necessary shared secret keys to protect the subsequent wireless communications. Due to the ad hoc nature of the BAN and the extreme resource constraints of sensor devices, providing secure, efficient and userfriendly trust initialization is a challenging task. Traditional solutions for wireless sensor networks mostly depend on key pre-distribution, which is unsuitable for BAN in many ways. In this paper, we propose group device pairing (GDP), a user-aided multi-party authenticated key agreement protocol. Through GDP, a group of sensor devices that have no pre-shared secrets, establish initial trust by by generating various shared secret keys out of an unauthenticated channel. Devices authenticate themselves to each other under the aid of a human user who performs visual verifications. The GDP supports fast batch deployment, addition and revocation of sensor devices, does not rely on any additional hardware device, and is mostly based on symmetric key cryptography. We formally prove the security of the proposed protocols, and we implement GDP on a sensor network testbed and report performance evaluation results.

show abstract

Section: Group Key Agreement Schemementioning

confidence: 99%

Section: Security Analysismentioning

confidence: 99%

Secure ad hoc trust initialization and key management in wireless body area networks

Guttman

et al. 2013

ACM Trans. Sen. Netw.

102

View full text Add to dashboard Cite

show abstract

“…Some typical schemes include: Burmester and Desmedt Protocol [9], Group Diffie-Hellman key exchange [38], Octopus Protocol [5], Conference Key Agreement [7], Distributed Logical Key Hierarchy [34], Distributed One-way Function Tree [16], Diffie-Hellman Logical Key Hierarchy [28,21], Distributed Flat Table [40], etc. Recent references paid more attentions to contributory and collaborative group key agreement [14,46,24,25,1,2], etc. Recently, the concepts of asymmetric group key agreement and contributory broadcast encryption were proposed [42,43].…”

Section: A Brief Survey Of Related Workmentioning

confidence: 99%

Provably Secure Group Key Management Approach Based upon Hyper-Sphere

Tang

Liu

et al. 2014

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract. Secure group communication systems have become increasingly important for many emerging network applications. An efficient and robust group key management approach is indispensable to a secure group communication system. Motivated by the theory of hyper-sphere, this paper presents a new group key management approach with a group controller GC. In our new design, a hypersphere is constructed for a group and each member in the group corresponds to a point on the hyper sphere, which is called the member's private point. The GC computes the central point of the hyper-sphere, intuitively, whose "distance" from each member's private point is identical. The central point is published such that each member can compute a common group key, using a function by taking each member's private point and the central point of the hyper-sphere as the input. This approach is provably secure under the pseudo-random function (PRF) assumption. Compared with other similar schemes, by both theoretical analysis and experiments, our scheme (1) has significantly reduced memory and computation load for each group member; (2) can efficiently deal with massive membership change with only two re-keying messages, i.e., the central point of the hypersphere and a random number; and (3) is efficient and very scalable for large-size groups.

show abstract

“…Varying levels of crypto-graphic protection implies a varying level of overhead in the form of increased packet size, code size, processor usage etc. [8]. Generally, asymmetric as well as symmetric cryptography could be employed to achieve security [18].…”

Section: Security Architecturementioning

confidence: 99%

“…AP-1 is based on the constant round multi-party dynamic key agreement protocol DB [8] whereas AP-2 uses the pairing-based group key agreement protocol DBS [9] and assumes that the CHs are arranged in a tree-structure. Both protocols assume that a group of nodes is organized in a number of clusters according to their relative proximity to one another and perform a GKA protocol to generate a cluster key.…”

Section: Ap-1 and Ap-2 Protocolsmentioning

confidence: 99%

A Survey on Wireless Sensor Networks Security with the Integration of Clustering and Keying Techniques

Singh¹,

Sharma²

2013

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

show abstract

Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting

Cited by 96 publications

References 29 publications

Secure ad hoc trust initialization and key management in wireless body area networks

Secure ad hoc trust initialization and key management in wireless body area networks

Provably Secure Group Key Management Approach Based upon Hyper-Sphere

A Survey on Wireless Sensor Networks Security with the Integration of Clustering and Keying Techniques

Contact Info

Product

Resources

About