Abstract
In this paper, we demonstrate that Kumar-Tripathi’s anonymous authenticated group key agreement protocol is insufficient in authenticity and unlinkability. Then the scheme is improved based on the Computational Diffie-Hellman (CDH) problem and Divisible Computational Diffie-Hellman (DCDH) problem. Compared with available schemes, the improved scheme satisfies strengthened security with lower computational overhead. The security is proven formally using AVISPA.
Author supplied keywords
Cite
CITATION STYLE
Cao, X., Dang, L., Fan, K., & Fu, Y. (2017). An attack to an anonymous certificateless group key agreement scheme and its improvement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10656 LNCS, pp. 56–69). Springer Verlag. https://doi.org/10.1007/978-3-319-72389-1_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
