Abstract
Traditional formal approaches such as theorem proving and model checking have been widely used to analyse security protocols. Ideally, they assume that the data communication is reliable and require the user to predetermine authentication goals mentioned in Chapter 5. However, missing and inconsistent data have been greatly ignored, and the increasingly complicated security protocols make it difficult to predefine such goals. We thus presents a novel approach in this chapter to analyse security protocols using association rule mining. It is able to not only validate the reliability of transactions but also discover potential correlations between secure messages. The algorithms and conducted experiments demonstrate that our approaches are useful in enhancing the current protocol analysis.
The rest of this chapter is organized as follows. We start from Section 6.1 by introducing inconsistent secure messages and data mining. Section 6.2 briefly overviews the related work. Section 6.3 presents some basic concepts. Section 6.4 presents how to analyse inconsistent secure messages using association rule mining. algorithms and experiments are described in Section 6.5. Finally, we conclude this chapter in Section 6.6.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chen, Q., Zhang, C., Zhang, S. (2008). Applications of Data Mining in Protocol Analysis. In: Secure Transaction Protocol Analysis. Lecture Notes in Computer Science, vol 5111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85074-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-85074-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85073-1
Online ISBN: 978-3-540-85074-8
eBook Packages: Computer ScienceComputer Science (R0)