Year: 2025
Type: article
Abstract: Enforcement of information-flow policies has been extensively studied by language-based approaches over the past few decades. In this paper, we propose an alternative, novel, general, and effective approach using enforcement of hyperproperties– a powerful formalism for expressing and reasoning about a wide range of information-flow security policies. We study black- vs. gray- vs. white-box enforcement of hyperproperties expressed by nondeterministic finite-word hyperautomata (NFH), where the enforcer has null, some, or complete information about the implementation of the system under scrutiny. Given an NFH, in order to generate a runtime enforcer, we reduce the problem to controller synthesis for hyperproperties and subsequently to the satisfiability problem for quantified Boolean formulas (QBFs). The resulting enforcers are transferable with low-overhead. We conduct a rich set of case studies, including information-flow control for JavaScript code, as well as synthesizing obfuscators for control plants.
Source: Acta Informatica
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,290
Awards: G2174310920, Collaborative Research: Cyber-secure and Resilient Supervisory Control of Networked Discrete-Event Systems, CPS: Small: Scalable and safe control synthesis for systems with symmetries, G5528860119, Training and Guiding AI Agents with Ethical Rules, G727611373, Collaborative Research: SaTC: CORE: Small: Hyperproperty-based Enforcement of Information-flow Security
OpenAlex ID: W4413240363