Bridging language-based and process calculi security

  • Authors:
  • Riccardo Focardi;Sabina Rossi;Andrei Sabelfeld

  • Affiliations:
  • Dipartimento di Informatica, Università Ca' Foscari di Venezia, Venezia, Italy;Dipartimento di Informatica, Università Ca' Foscari di Venezia, Venezia, Italy;Dept. of Computer Science, Chalmers University of Technology, Göteborg, Sweden

  • Venue:
  • FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Language-based and process calculi-based information security are well developed fields of computer security. Although these fields have much in common, it is somewhat surprising that the literature lacks a comprehensive account of a formal link between the two disciplines. This paper develops such a link between a language-based specification of security and a process-algebraic framework for security properties. Encoding imperative programs into a CCS-like process calculus, we show that timing-sensitive security for these programs exactly corresponds to the well understood process-algebraic security property of persistent bisimulation-based nondeducibility on compositions (P_BNDC). This rigorous connection opens up possibilities for cross-fertilization, leading to both flexible policies when specifying the security of heterogeneous systems and to a synergy of techniques for enforcing security specifications.