On the Security of an Efficient and Non-interactive Hierarchical Key Agreement Protocol

Authors:
Guobin Zhu;Hu Xiong;Zhiguang Qin
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Chengdu, China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
Venue:
Wireless Personal Communications: An International Journal
Year:
2014

Citing 10
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Perfectly secure key distribution for dynamic conferences

Information and Computation
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Toward Hierarchical Identity-Based Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs

ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Reducing elliptic curve logarithms to logarithms in a finite field

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a fundamental cryptographic primitive, key agreement protocol allows two or more parties to agree on shared keys which will be used to protect their later communication. To resist against the corruption of any number of nodes at any level in the hierarchy, Guo et al. (Comput Secur 30:28---34, 2011) proposed a novel non-interactive hierarchical identity-based key agreement protocol along with a claimed security proof in the random oracle model. Unfortunately, by giving concrete attacks, we indicate that Guo et al.'s protocol is not secure even against the corruption of any leaf or intermediate nodes in the hierarchy. Concretely, the session key of one node will be compromised provided that one of its child node has been corrupted.