FASER Formal and Automatic Security Enforcement by Rewriting by BPA algebra with test

Authors:
Guangye Sui;Mohamed Mejri
Affiliations:
Laboratory of Computer Security, Laval University, Quebec, Canada;Laboratory of Computer Security, Laval University, Quebec, Canada
Venue:
International Journal of Grid and Utility Computing
Year:
2013

Citing 18
Cited 0

Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Program analysis: the abstract interpretation perspective

ACM SIGPLAN Notices
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Derivatives of Regular Expressions

Journal of the ACM (JACM)
A type system for expressive security policies

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enforceable security policies

ACM Transactions on Information and System Security (TISSEC)
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Scalable Certification for Typed Assembly Language

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Model checking

Handbook of automated reasoning
A tool for constructing safe extensible C++ systems

COOTS'97 Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3
Using Edit Automata for Rewriting-Based Security Enforcement

Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Hyperproperties

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Corrective enforcement of security policies

FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Formal enforcement of security policies on concurrent systems

Journal of Symbolic Computation
Fairness electronic payment protocol

International Journal of Grid and Utility Computing
Monodic tree kleene algebra

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
PPPDM - a privacy-preserving platform for data mashup

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A correct and a cheap enforcement of security policies on information systems is a major problem for most of our institutions. In previous works, we introduced a program rewriting approach that can automatically and formally enforce security policies on untrusted programs. The program and the security policy are specified as processes in an extended version of BPA Basic Process Algebra. After that, the enforcement problem is turned to the resolution of a linear system. In this paper, we extend the expressiveness of the algebra by adding tests which is an important step towards enforcing security policies on more real interesting systems.