×
We define typed versions of may and must equivalences for the security π-calculus, where the tests are parameterised relative to a security level. We provide ...
This enables us to introduce a range of typing disciplines which allow input or output behaviour, or both, to be bounded above or below by a given security ...
We define typed versions of may and must equivalences for the security π-calculus, where the tests are parameterised relative to a security level.
A theory of non-interference for a typed version of the π-calculus where types are used to assign secrecy levels to channels and is characterized in terms ...
Using these alternative characterisations we prove non-interference results with respect to may and must testing. These show that information flow between ...
Oct 22, 2024 · Abstract. The security π-calculus is a typed version of the asynchronous π-calculus in which the types, in addition to constraining the input ...
Aug 11, 2003 · Abstract. The security π-calculus is a typed version of the asynchronous π-calculus in which the types, in addition to constraining the ...
Jun 8, 2023 · The security p-calculus is a typed version of the asynchronous p-calculus in which the types, in addition to constraining the input/output ...
Missing: (Extended Abstract).
People also ask
The Security Picalculus and Non-interference (extended abstract). In Conference Record of MFPSXIX, 2003. Full version available as University of Sussex ...
The Security Picalculus and Non-interference (Extended Abstract) · Author ... Security type systems are usually intended to enforce noninterference, a ...