Archives and Documentation Center
Digital Archives

FPFM : a formal specification and verification framework for security policies in multi-domain mobile networks

Show simple item record

dc.contributor Ph.D. Program in Computer Engineering.
dc.contributor.advisor Çağlayan, M. Ufuk.
dc.contributor.author Ünal, Devrim.
dc.date.accessioned 2023-03-16T10:13:34Z
dc.date.available 2023-03-16T10:13:34Z
dc.date.issued 2011.
dc.identifier.other CMPE 2011 U53 PhD
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/12570
dc.description.abstract We present a framework called Formal Policy Framework for Mobility (FPFM) for the specification and verification of domain and inter-domain security policies in a multi-domain mobile network environment. FPFM supports the specification of security policies with mobility and location constraints, role hierarchy mapping, interdomain services, inter-domain access rights and separation of duty. The specification of security policies in FPFM is based on a formal security policy model, called FPMRBAC (Formal Policy Model for Mobility with Role Based Access Control) and a XML based security policy specification language called XFPM-RBAC (XML Based Formal Policy Language for Mobility with Role Based Access Control). Formal verification of security policies ensure that the security policy is satisfied by the network elements in a given network configuration. FPFM supports extraction of formal specifications from defined network configurations, domain and inter-domain security policies. Another novel aspect of FPFM is the support for formal information flow analysis related to mobility within multiple security domains. Automated verification of formal specifications are carried out through model checking and theorem proving. A spatio-temporal model checking algorithm has been proposed and a model checking tool has been developed for spatio-temporal model checking of location and mobility constraints in security policy rules. Conflicts within security policy rules are resolved through theorem proving with the help of the Coq interactive theorem prover.
dc.format.extent 30 cm.
dc.publisher Thesis (Ph.D.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2011.
dc.relation Includes appendices.
dc.relation Includes appendices.
dc.subject.lcsh Computer security.
dc.title FPFM : a formal specification and verification framework for security policies in multi-domain mobile networks
dc.format.pages xxiv, 218 leaves ;


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital Archive


Browse

My Account