Secure-by-construction synthesis of cyber-physical systems
Correct-by-construction synthesis is a cornerstone of the confluence of formal methods and
control theory towards designing safety-critical systems. Instead of following the time-tested …
control theory towards designing safety-critical systems. Instead of following the time-tested …
Deciding differential privacy for programs with finite inputs and outputs
Differential privacy is a de facto standard for statistical computations over databases that
contain private data. Its main and rather surprising strength is to guarantee individual privacy …
contain private data. Its main and rather surprising strength is to guarantee individual privacy …
The complexity of verifying boolean programs as differentially private
We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …
programs working over boolean values and making probabilistic choices. Programs in this …
On a notion of approximate opacity for discrete-time stochastic control systems
This paper investigates a confidentiality property called opacity for discrete-time stochastic
control systems. In order to quantitatively evaluate the security guarantee, a notion of …
control systems. In order to quantitatively evaluate the security guarantee, a notion of …
The complexity of verifying loop-free programs as differentially private
We study the problem of verifying differential privacy for loop-free programs with probabilistic
choice. Programs in this class can be seen as randomized Boolean circuits, which we will …
choice. Programs in this class can be seen as randomized Boolean circuits, which we will …
The big-O problem for labelled Markov chains and weighted automata
D Chistikov, S Kiefer, AS Murawski… - … in Informatics (LIPIcs), 2020 - wrap.warwick.ac.uk
Given two weighted automata, we consider the problem of whether one is big-O of the other,
ie, if the weight of every finite word in the first is not greater than some constant multiple of …
ie, if the weight of every finite word in the first is not greater than some constant multiple of …
Privacy-preserving resilience of cyber-physical systems to adversaries
A cyber-physical system (CPS) is expected to be resilient to more than one type of
adversary. In this paper, we consider a CPS that has to satisfy a linear temporal logic (LTL) …
adversary. In this paper, we consider a CPS that has to satisfy a linear temporal logic (LTL) …
Optimal Obfuscation to Protect Client Privacy in Federated Learning
Distributed data processing by clients with reports to a central server is an important
component of contemporary discovery systems, eg, federated learning. Although such client …
component of contemporary discovery systems, eg, federated learning. Although such client …
[HTML][HTML] A logical characterization of differential privacy
V Castiglioni, K Chatzikokolakis… - Science of Computer …, 2020 - Elsevier
Differential privacy is a formal definition of privacy ensuring that sensitive information relative
to individuals cannot be inferred by querying a database. In this paper, we exploit a …
to individuals cannot be inferred by querying a database. In this paper, we exploit a …
Privacy-Preserving Reinforcement Learning Beyond Expectation
A Rajabi, B Ramasubramanian… - 2022 IEEE 61st …, 2022 - ieeexplore.ieee.org
Cyber and cyber-physical systems equipped with machine learning algorithms such as
autonomous cars share environments with humans. In such a setting, it is important to align …
autonomous cars share environments with humans. In such a setting, it is important to align …