Authenticated asymmetric group key agreement based on certificateless cryptosystem

Lv, Xixiang; Li, Hui; Wang, Baocang

doi:10.1080/00207160.2013.806653

Cited by 23 publications

(35 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3.3), and proposed a concrete CL-AAGKA protocol which enables a group of user to establish a common encryption and their respective decryption keys in one round. Unlike the security model in [19], our model enables an attacker to obtain any decryption key of any user, except the decryption keys generated in the target session.…”

Section: Our Contributionmentioning

confidence: 95%

“…However, the formal security analysis of the protocol in [22] is not given. In [19], a certificateless AAGKA is presented together with a security proof. However, in the proof, an attacker cannot get any decryption key related to the target user, which implies that the known-key security property is not considered.…”

Section: Introductionmentioning

confidence: 99%

“…Though key agreement protocols in ID-PKC may achieve session key escrow freeness [31,34], i.e., the secrecy of previous messages is not violated even if the PKG is corrupted, the PKG may still impersonate a user or launch a man-in-the-middle attack to obtain the secret session key without being caught due to the key escrow problem. Recently, AAGKA protocols are studied in CL-PKC [19,22] which aims to eliminate the key escrow problem. However, the formal security analysis of the protocol in [22] is not given.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Certificateless and identity-based authenticated asymmetric group key agreement

Zhang

Qin

et al. 2016

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Group key agreement (GKA) is one of the traditional ways to guarantee the subsequent secure group communications. However, conventional GKA protocols face two limitations, i.e., they require two or more rounds to establish secure channels and are sender restricted. Asymmetric group key agreement (AGKA) eliminates above two limitations of GKA. It allows a group of users to establish a public group encryption key and a different secret decryption key of each group member in one round. Any user who knows the group encryption key can encrypt to the group members. This paper studies authenticated AGKA in certificateless and identity-based public key cryptosystems. We formalize the security model of certificateless authenticated asymmetric group key agreement and realize a one-round certificateless authenticated asymmetric group key agreement protocol to resist active attacks in the real world. We also investigate B Lei Zhang the relation between certificateless authenticated AGKA and identity-based authenticated AGKA. We propose a concrete conversion from certificateless authenticated AGKA to session key escrow-free identity-based authenticated AGKA.Keywords Certificateless public key cryptosystem · Identity-based public key cryptosystem · Group key agreement · Asymmetric group key agreement

show abstract

Section: Our Contributionmentioning

confidence: 95%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Certificateless and identity-based authenticated asymmetric group key agreement

Zhang

Qin

et al. 2016

Int. J. Inf. Secur.

View full text Add to dashboard Cite

show abstract

“…However, it is unclear how to use this method without affecting the round efficiency of AGKA protocols. We note that AGKA was later extended to certificateless public key cryptosystems [15], [19], [22], which can be viewed as a variant of IBC. Nevertheless, no formal security analysis is given for the protocol in [19].…”

Section: Related Workmentioning

confidence: 99%

“…Nevertheless, no formal security analysis is given for the protocol in [19]. The protocol in [15] is proven in a formal security model, but the knownkey security property is not modeled. The protocol in [22] is proposed with a formal security analysis.…”

Section: Related Workmentioning

confidence: 99%

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

Zhang

Domingo-Ferrer

et al. 2015

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of group key agreement in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric group key agreement protocol which allows a group of members to dynamically establish a public group encryption key while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multi-signature scheme. The proposed protocol is shown to be secure under the k-bilinear Diffie-Hellman exponent assumption.

show abstract

A provably secure sharding based blockchain smart contract centric hierarchical group key agreement for large wireless ad‐hoc networks

Naresh¹,

Allavarpu

Reddi

et al. 2021

Concurrency and Computation

View full text Add to dashboard Cite

Group key management with privacy preserving and trust still remains a precarious and stimulating issue for securing multicast communications in an energy embarrassed large wireless ad-hoc networks (WANETs). To address this, few researchers with the adaption of blockchain technology and practical usage of a privacy-preserving smart contract as group controller made these group key agreements adaptable to WANET. However, proportionate to the increase in the size of the group, the processing load on the smart contract is also increasing, which made the capability of the smart contract could not work beyond a certain group size. Contemporary blockchain schemes suffer from various inherent shortcomings in their latency, scalability, and processing throughput. So, in this direction, we adopted blockchain sharding smart contract-centric processing for making the key agreement adaptable to large WANETs.In this technique, we divide the large network into r sharded subnetworks with G 1 , G 2 , G 3 , … , G r as smart contract instances generated by group controller G, which acts as subgroup controllers to their respective shards using blockchain sharding technique. This protocol is shown secure under the assumptions elliptic curve decision Diffie-Hellman and group-elliptic curve Diffie-Hellman. The performance analysis demonstrates that the proposed protocol is highly proficient than examined protocols for secure communication in large WANETs.

show abstract

Authenticated asymmetric group key agreement based on certificateless cryptosystem

Cited by 23 publications

References 24 publications

Certificateless and identity-based authenticated asymmetric group key agreement

Certificateless and identity-based authenticated asymmetric group key agreement

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

A provably secure sharding based blockchain smart contract centric hierarchical group key agreement for large wireless ad‐hoc networks

Contact Info

Product

Resources

About