Provably secure one-round identity-based authenticated asymmetric group key agreement protocol

Zhang, Lei; Wu, Qianhong; Qin, Bo; Domingo-Ferrer, Josep

doi:10.1016/j.ins.2011.05.009

Cited by 56 publications

(58 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bilinear maps are widely used in many cryptosystems, e.g., identitybased cryptography (IBC) [38] and group signature schemes [23]. We briefly review them here.…”

Section: Bilinear Mapsmentioning

confidence: 99%

Practical secure and privacy-preserving scheme for value-added applications in VANETs

Zhang

Qin

et al. 2015

Computer Communications

Self Cite

View full text Add to dashboard Cite

“…Bilinear maps are widely used in many cryptosystems, e.g., identitybased cryptography (IBC) [38] and group signature schemes [23]. We briefly review them here.…”

Section: Bilinear Mapsmentioning

confidence: 99%

Practical secure and privacy-preserving scheme for value-added applications in VANETs

Zhang

Qin

et al. 2015

Computer Communications

Self Cite

View full text Add to dashboard Cite

“…COMMUNICATION The emphasis of our paper is the agreement phase, so we next simply introduce the communication phase. We show a secure CCA2 public-key encryption scheme coming from [14] in Figure 4.…”

Section: Inmentioning

confidence: 99%

“…But the protocol in the [11] is only secure against passive adversaries who just eavesdrop the communication channel. In 2011, Zhang et al [14] proposed an authenticated ASGKA protocol that is proved to be secure against positive attack, but it is proved in the random oracle model and the efficiency is not well. Later, a series of protocols are proposed in [15], [13], but their security also need to improve.…”

Section: Introductionmentioning

confidence: 99%

Universally composable asymmetric group key agreement protocol

Yong

Zeng

et al. 2015

2015 10th International Conference on Information, Communications and Signal Processing (ICICS)

View full text Add to dashboard Cite

We analyze the security of asymmetric group key agreement (ASGKA) protocol in the universal composability (UC) framework. An ideal functionality that is suitable for ASGKA protocol is proposed. And we show that the ASGKA protocol securely realizes the proposed ideal functionality that can resist attacks by malicious insiders. The UC framework allows the protocols to guarantee their security under arbitrary protocol environment.

show abstract

“…Therefore, an active adversary who has control over the communication channel can mount a man-in-the-middle attack [11]. Authenticated KA [19,20] enables two or more parties to establish a shared session key over an insecure channel.…”

Section: Introductionmentioning

confidence: 99%

Provably Secure Certificateless One-Way and Two-Party Authenticated Key Agreement Protocol

Zhang

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Key agreement protocols are one of the fundamental primitives in cryptography. In this paper, we formalize the security model for certificateless one-way and two-party authenticated key agreement protocols and propose a concrete certificateless one-way and two-party authenticated key agreement protocol. The security of our protocol is proven under the computational Diffie-Hellman, square computational Diffie-Hellman and gap bilinear Diffie-Hellman assumptions. As for efficiency, the protocol requires only one pass and has low communication overhead.

show abstract

Provably secure one-round identity-based authenticated asymmetric group key agreement protocol

Cited by 56 publications

References 22 publications

Practical secure and privacy-preserving scheme for value-added applications in VANETs

Practical secure and privacy-preserving scheme for value-added applications in VANETs

Universally composable asymmetric group key agreement protocol

Provably Secure Certificateless One-Way and Two-Party Authenticated Key Agreement Protocol

Contact Info

Product

Resources

About