Statically assuring secrecy for dynamic concurrent processes

  • Authors:
  • Rachid Echahed;Frédéric Prost;Wendelin Serwe

  • Affiliations:
  • LEIBNIZ -- IMAG -- CNRS, Grenoble, France;LEIBNIZ -- IMAG -- CNRS, Grenoble, France;IRISA, Rennes, France

  • Venue:
  • Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.03

Visualization

Abstract

We propose a new algorithm of secrecy analysis in a framework integrating declarative programming and concurrency. The analysis of a program ensures that information can only flow from less sensitive levels toward more sensitive ones. Our algorithm uses a terminating abstract operational semantics which reduces the problem of secrecy to constraint solving within finite lattices. It departs in that from the previous works essentially based on type systems. Furthermore, our proposal is general and tackles a very large class of programs, featuring dynamic process creation, general sequential composition, recursive process calls and high level synchronization.