@article {Joy2017,
	title = {A formal framework for verifying {\.I}KA\} property of protocols},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	year = {2017},
	note = {n/a},
	pages = {-},
	abstract = {<p>Abstract A group key agreement (GKA) protocol generates a secret key (session key) shared among the members of the group, from the contributions made by group members. \{GKA\} protocols are expected to satisfy the property of Implicit Key Authentication (IKA) which assures group members that the key generated by the protocol is not accessible to any member outside the group. In this article, we propose a technique to prove the correctness of \{GKA\} protocols with respect to IKA. We establish the soundness of our proposal and also illustrate its application. Normally {\.I}KA\} property of protocols is established by proving that the protocol satisfies authentication of participants and secrecy of the session keys. Most formal models would be able to analyze a \{GKA\} protocol with respect to IKA, using the above approach. However analysis of two security properties, namely authentication and secrecy, would increase the chances of errors. We propose a single condition for verifying whether the \{GKA\} protocol satisfies IKA.</p>
},
	keywords = {Formal Framework},
	issn = {1319-1578},
	doi = {http://dx.doi.org/10.1016/j.jksuci.2017.01.002},
	url = {//www.sciencedirect.com/science/article/pii/S1319157816300866},
	author = {Shyam P.  Joy and Priya Chandran}
}
