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
SIAM Journal on Computing
Toward Hierarchical Identity-Based Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
A comparison of MNT curves and supersingular curves
Applicable Algebra in Engineering, Communication and Computing
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
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
Hierarchical identity-based chameleon hash and its applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
On the Security of an Efficient and Non-interactive Hierarchical Key Agreement Protocol
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Key agreement is a fundamental security functionality by which pairs of nodes agree on shared keys to be used for protecting their pairwise communications. In this work we study key-agreement schemes that are well-suited for the mobile network environment. Specifically, we describe schemes with the following characteristics:Non-interactive:any two nodes can compute a unique shared secret key without interaction;Identity-based:to compute the shared secret key, each node only needs its own secret key and the identity of its peer;Hierarchical:the scheme is decentralized through a hierarchy where intermediate nodes in the hierarchy can derive the secret keys for each of its children without any limitations or prior knowledge on the number of such children or their identities;Resilient:the scheme is fully resilient against compromise of any number of leavesin the hierarchy, and of a threshold number of nodes in each of the upper levels of the hierarchy.Several schemes in the literature have three of these four properties, but the schemes in this work are the first to possess all four. This makes them well-suited for environments such as MANETs and tactical networks which are very dynamic, have significant bandwidth and energy constraints, and where many nodes are vulnerable to compromise. We provide rigorous analysis of the proposed schemes and discuss implementations aspects.