A General Noninterference Policy for Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

A General Noninterference Policy for Polynomial Time

Abstract

We introduce a new noninterference policy to capture the class of functions computable in polynomial time on an object-oriented programming language. This policy makes a clear separation between the standard noninterference techniques for the control flow and the layering properties required to ensure that each "security" level preserves polynomial time soundness, and is thus very powerful as for the class of programs it can capture. This new characterization is a proper extension of existing tractable characterizations of polynomial time based on safe recursion. Despite the fact that this noninterference policy is Π 0 1-complete, we show that it can be instantiated to some decidable and conservative instance using shape analysis techniques.
Fichier principal
Vignette du fichier
shapedTiering.pdf (763.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY NC SA - Attribution - NonCommercial - ShareAlike

Dates and versions

hal-04190355 , version 1 (29-08-2023)

Licence

Attribution - NonCommercial - ShareAlike

Identifiers

Cite

Emmanuel Hainry, Romain Péchoux. A General Noninterference Policy for Polynomial Time. POPL 23, Jan 2023, Boston, United States. pp.806 - 832, ⟨10.1145/3571221⟩. ⟨hal-04190355⟩
31 View
17 Download

Altmetric

Share

Gmail Facebook X LinkedIn More