Name
Abstract | ||
|---|---|---|
The most important security concern in group key exchange protocols is the semantic security of the produced shared key which dictates that outsiders should not be able to learn anything about the key. It is also challenging for these protocols to retain their security even in the presence of dishonest insiders who do not follow the protocol specifications. In this paper, we propose an identity-based group key exchange protocol which addresses these security concerns. We prove that our scheme achieves semantic security in a well-known adversarial model. We then show that the success probability of recognizing dishonest insiders in the proposed scheme is almost one. We further provide a comparison between our protocol and some other schemes in terms of computation and communication cost, as well as security properties. |
Year | Venue | Field |
|---|---|---|
2016 | I. J. Network Security | Semantic security,Computer security,Computer science,Group key exchange,Computer network,Security association,Bilinear pairing,Security properties,Computation,Provable security,Adversarial system |
DocType | Volume | Issue |
Journal | 18 | 1 |
Citations | PageRank | References |
4 | 0.41 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ziba Eslami | 1 | 76 | 13.97 |
| Mahnaz Noroozi | 2 | 26 | 3.18 |
| Saideh Kabiri Rad | 3 | 16 | 0.98 |