Analysing security protocols using refinement in iUML-B

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a general approach based on abstraction and refinement for constructing and analysing security protocols using formal specification and verification. We use class diagrams to specify conceptual system entities and their relationships. We use state-machines to model the protocol execution involving the entities’ interactions. Features of our approach include specifying security principles as invariants of some abstract model of the overall system. The specification is then refined to introduce implementable mechanisms for the protocol. A gluing invariant specifies why the protocol achieves the security principle. Security breaches arise as violations of the gluing invariant. We make use of both theorem proving and model checking techniques to analyse our formal model, in particular, to explore the source and consequence of the security attack. To demonstrate the use of our approach we explore the mechanism of a security attack in a network protocol.

Author supplied keywords

Cite

CITATION STYLE

APA

Snook, C., Hoang, T. S., & Butler, M. (2017). Analysing security protocols using refinement in iUML-B. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10227 LNCS, pp. 84–98). Springer Verlag. https://doi.org/10.1007/978-3-319-57288-8_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free