Abstract
The paper shows how a model checkable logic of belief and time (MATL) can be used to check properties of security protocols employed in computer networks. In MATL, entities participating to protocols are modeled as concurrent processes able to have beliefs about other entities. The approach is applied to the verification of TLS, the Internet Standard Protocol that IETF derived from the SSL 3.0 of Netscape. The results of our analysis show that the protocol satisfies all the security requirements for which it was designed.
Cite
CITATION STYLE
Benerecetti, M., Panti, M., Spalazzi, L., & Tacconi, S. (2002). Verification of the SSL/TLS protocol using a model checkable logic of belief and time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2434, pp. 126–138). Springer Verlag. https://doi.org/10.1007/3-540-45732-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
