Rahul Prasad - Academia.edu (original) (raw)
Uploads
Papers by Rahul Prasad
23 A group key agreement (GKA) protocol generates a secret key (session key) shared among the mem... more 23 A group key agreement (GKA) protocol generates a secret key (session key) shared among the members of 24 the group, from the contributions made by group members. GKA protocols are expected to satisfy the 25 property of Implicit Key Authentication (IKA) which assures group members that the key generated by 26 the protocol is not accessible to any member outside the group. In this article, we propose a technique 27 to prove the correctness of GKA protocols with respect to IKA. We establish the soundness of our proposal 28 and also illustrate its application. 29 Normally IKA property of protocols is established by proving that the protocol satisfies authentication 30 of participants and secrecy of the session keys. Most formal models would be able to analyze a GKA pro-31 tocol with respect to IKA, using the above approach. However analysis of two security properties, namely 32 authentication and secrecy, would increase the chances of errors. We propose a single condition for ver-33 ifying whether the GKA protocol satisfies IKA.
23 A group key agreement (GKA) protocol generates a secret key (session key) shared among the mem... more 23 A group key agreement (GKA) protocol generates a secret key (session key) shared among the members of 24 the group, from the contributions made by group members. GKA protocols are expected to satisfy the 25 property of Implicit Key Authentication (IKA) which assures group members that the key generated by 26 the protocol is not accessible to any member outside the group. In this article, we propose a technique 27 to prove the correctness of GKA protocols with respect to IKA. We establish the soundness of our proposal 28 and also illustrate its application. 29 Normally IKA property of protocols is established by proving that the protocol satisfies authentication 30 of participants and secrecy of the session keys. Most formal models would be able to analyze a GKA pro-31 tocol with respect to IKA, using the above approach. However analysis of two security properties, namely 32 authentication and secrecy, would increase the chances of errors. We propose a single condition for ver-33 ifying whether the GKA protocol satisfies IKA.