Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Foundations and Practice of Security

FPS 2015: Foundations and Practice of Security pp 311–321Cite as

Security Enforcement by Rewriting: An Algebraic Approach

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9482))

Abstract

This paper introduces a formal program-rewriting approach that can automatically enforce security policies on non trusted programs. For a program P and a security policy \(\varPhi \), we generate another program \(P'\) that respects the security policy and behaves like P except that it stops any execution path whenever the enforced security policy is about to be violated. The presented approach uses the \(\mathcal {E}BPA_{0,1}^*\) algebra which is a variant of BPA (Basic Process Algebra) extended with variables, environments and conditions. The problem of computing the expected enforced program \(P'\) will turn to resolve a linear system which we already know how to extract the solution by a polynomial algorithm.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on FOCS, pp. 46–57 (1977)

    Google Scholar 

  2. Schneider, F.B.: Enforceable security policies. ACM Trans. Inf. Syst. Secur. 3(1), 30–50 (2000)

    Article  Google Scholar 

  3. Alpern, B., Schneider, F.: Recognizing saftey, and liveness. Distrib. Comput. 2(3), 117–126 (1987)

    Article  MATH  Google Scholar 

  4. Clarkson, M.R., Schneider, F.: Hyperproperties. In: J. Comput. Secur. 7thInternational Workshop on Issues in the Theory of Security (WITS 2007) 18(6). IOS Press, Amsterdam (2010)

    Google Scholar 

  5. Walker, D.: A type system for expressive security policies. In: POPL 2000: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 254–267. ACM (2000)

    Google Scholar 

  6. Khoury, R., Tawbi, N.: Corrective enforcement of security policies. In: Degano, P., Etalle, S., Guttman, J. (eds.) Formal Aspects in Security and Trust. LNCS, vol. 6561, pp. 176–190. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Clarke, E.M., Schlingloff, B.H.: Model checking. In: Handbook of Automated Reasoning, pp. 1635–1790 (2001)

    Google Scholar 

  8. Necula, G.: Proof-carring code. In: Proceedings of the POPL 1997, pp. 106–119. ACM Press (1997)

    Google Scholar 

  9. Deutsch, P., Grant, C.: A flexible measurement tool for software systems. In: 71 Proceedings of the IFIP Congress Information Processing, pp. 320–326. Yugoslavia (1971)

    Google Scholar 

  10. Langar, M., Mejri, M., Adi, K.: Formal enforcement of security policies on concurrent systems. J. Symb. Comput. 46(9), 997–1016 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sui, G., Mejri, M., Ben Sta, H.: FASER (formal, automatic security enforcement by rewriting): an algebraic approach. In: Computational Intelligence for Security and Defence Applications (CISDA) (2012)

    Google Scholar 

  12. Mejri, M., Fujita, H.: Enforcing security policies using algebraic approach. SoMeT 182, 84–98 (2008)

    Google Scholar 

  13. Pardo, A.: Many-sorted algebras. grupo de métodos formales instituto de computación facultad de ingenierá

    Google Scholar 

  14. Bergstra, J.A., Klop, J.W.: The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (ed.) Automata, Languages and Programming. LNCS, vol. 172, pp. 82–94. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  15. https://drive.google.com/file/d/0B8V7WaS6PT37U29XLThkLXhVWlk/view?usp=sharing

  16. FASER website. http://web\_security.fsg.ulaval.ca:8080/enf/enforce-cbpa-program.jsp

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement of Computer Science, Laval University, Quebec, Canada

    Guangye Sui & Mohamed Mejri

Authors
  1. Guangye Sui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Mejri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guangye Sui .

Editor information

Editors and Affiliations

  1. Télécom SudParis, Evry, France

    Joaquin Garcia-Alfaro

  2. School of Computer Science, Carleton University, Ottawa, Ontario, Canada

    Evangelos Kranakis

  3. École des Mines de Nancy, Université de Lorraine, Nancy Cedex, France

    Guillaume Bonfante

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Sui, G., Mejri, M. (2016). Security Enforcement by Rewriting: An Algebraic Approach. In: Garcia-Alfaro, J., Kranakis, E., Bonfante, G. (eds) Foundations and Practice of Security. FPS 2015. Lecture Notes in Computer Science(), vol 9482. Springer, Cham. https://doi.org/10.1007/978-3-319-30303-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30303-1_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30302-4

  • Online ISBN: 978-3-319-30303-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation