Abstract
Security policy helps to ensure that system always takes the desired input action sequence and works in a proper manner. Formal verification of finite state transactional security policy is necessary to check whether the given policy conforms to the specification. One way to specify finite state transactional security policy is by using a filter automaton. A filter automaton is an action sequence transformer that maps an input action sequence into another, so that the output action sequence obeys the specified policy. A method for verification of finite state transactional security policy enforced by filter automata is being proposed. The observable actions finite security automaton and the observable actions finite truncation automaton are used to verify a finite state transactional security policy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters 21, 181–185 (1985)
Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distributed Computing 3, 117–126 (1987)
Beauquier, D., Cohen, J., Lanotte, R.: Security policies enforcement using finite edit automata. Electronic Notes in Theoretical Computer Science 229, 19–35 (2009)
Beauquier, D., Cohen, J., Lanotte, R.: Security policies enforcement using finite and pushdown edit automata. International Journal of Information Security 12, 319–336 (2013)
Bishop, M.: Computer Security: Art and Science. Addison-Wesly (2002)
Bishop, M., Venkatramanayya, S.S.: Introduction to Computer Security. Pearson Education (2006)
Costa, G., Matteucci, I.: Gate automata-driven run-time enforcement. Computers and Mathematics with Applications 63, 518–524 (2012)
Gay, R., Mantel, H., Sprick, B.: Service automata. In: Barthe, G., Datta, A., Etalle, S. (eds.) FAST 2011. LNCS, vol. 7140, pp. 148–163. Springer, Heidelberg (2012)
Khoussainov, B., Nerode, A.: Automata Theory and its applications. Birkhäuser (2001)
Ligatti, J., Bauer, L., Walker, D.: More enforceable security policies. In: Foundations of Computer Security Workshop (2002)
Ligatti, J., Bauer, L., Walker, D.: Edit automata: enforcement mechanism for run-time security policies. International Journal of Information Security 4, 2–16 (2005)
Ligatti, J., Bauer, L., Walker, D.: Run-time enforcement of nonsafety policies. ACM Transactions on Information and System Security 12, 19:1–19:41 (2009)
Rajamanickam, N., Nadarajan, R.: Implementing real-time transactional security property using timed edit automata. In: Proceedings of the Sixth International Conference on Security of Information and Networks, Aksaray, Turkey, pp. 429–432 (November 2013)
Schneider, F.B.: Enforceable security policies. ACM Transactions on Information and System Security 3, 30–50 (2000)
Talhi, C., Tawbi, N., Debbabi, M.: Execution monitoring enforcement under memory-limitation constraints. Information and Computation 206, 158–184 (2008)
Yang, Z., Hanna, A., Debbabi, M.: Team edit automata for testing security property. In: Third International Symposium on Information Assurance and Security, pp. 235–240 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Rajamanickam, N., Nadarajan, R., Elçi, A. (2014). Formal Verification of Finite State Transactional Security Policy. In: Au, M.H., Carminati, B., Kuo, CC.J. (eds) Network and System Security. NSS 2015. Lecture Notes in Computer Science, vol 8792. Springer, Cham. https://doi.org/10.1007/978-3-319-11698-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-11698-3_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11697-6
Online ISBN: 978-3-319-11698-3
eBook Packages: Computer ScienceComputer Science (R0)