Probabilistic Opacity in Refinement-Based Modeling

Given a probabilistic transition system (PTS) $\cal A$ partially observed by an attacker, and an $\omega$-regular predicate $\varphi$over the traces of $\cal A$, measuring the disclosure of the secret $\varphi$ in $\cal A$ means computing the probability that an attacker who observes a run of $\cal A$ can ascertain that its trace belongs to $\varphi$. In the context of refinement, we consider specifications given as Interval-valued Discrete Time Markov Chains (IDTMCs), which are underspecified Markov chains where probabilities on edges are only required to belong to intervals. Scheduling an IDTMC $\cal S$ produces a concrete implementation as a PTS and we define the worst case disclosure of secret $\varphi$ in ${\cal S}$ as the maximal disclosure of $\varphi$ over all PTSs thus produced. We compute this value for a subclass of IDTMCs and we prove that refinement can only improve the opacity of implementations

Opacity for Linear Constraint Markov Chains

On a partially observed system, a secret ϕ is opaque if an observer cannot ascertain that its trace belongs to ϕ. We consider specifications given as Constraint Markov Chains (CMC), which are underspec-ified Markov chains where probabilities on edges are required to belong to some set. The nondeterminism is resolved by a scheduler, and opacity on this model is defined as a worst case measure over all implementations obtained by scheduling. This measures the information obtained by a passive observer when the system is controlled by the smartest sched-uler in coalition with the observer. When restricting to the subclass of Linear CMC, we compute (or approximate) this measure and prove that refinement of a specification can only improve opacity

Introduction to Discrete Mathematics: An OER for MA-471

The first objective of this book is to define and discuss the meaning of truth in mathematics. We explore logics, both propositional and first-order , and the construction of proofs, both formally and human-targeted. Using the proof tools, this book then explores some very fundamental definitions of mathematics through set theory. This theory is then put in practice in several applications. The particular (but quite widespread) case of equivalence and order relations is studied with detail. Then we introduces sequences and proofs by induction, followed by number theory. Finally, a small introduction to combinatorics is given

Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment. While the reachability problem is undecidable for hybrid automata we show that it is decidable for ITA. More precisely we prove that the untimed language of an ITA is regular, by building a finite automaton as a generalized class graph. We then establish that the reachability problem for ITA is in NEXPTIME and in PTIME when the number of clocks is fixed. To prove the first result, we define a subclass ITA- of ITA, and show that (1) any ITA can be reduced to a language-equivalent automaton in ITA- and (2) the reachability problem in this subclass is in NEXPTIME (without any class graph). In the next step, we investigate the verification of real time properties over ITA. We prove that model checking SCL, a fragment of a timed linear time logic, is undecidable. On the other hand, we give model checking procedures for two fragments of timed branching time logic. We also compare the expressive power of classical timed automata and ITA and prove that the corresponding families of accepted languages are incomparable. The result also holds for languages accepted by controlled real-time automata (CRTA), that extend timed automata. We finally combine ITA with CRTA, in a model which encompasses both classes and show that the reachability problem is still decidable. Additionally we show that the languages of ITA are neither closed under complementation nor under intersection

Introduction to Computers and Programming using Python: A Project-based Approach

Welcome to the “Introduction to Computers and Programming using Python: A Project-based Approach”. This book is designed to teach basic programming skills to students who are new to the field of computing using a project-based learning approach. It has been designed to give freedom to the instructor, both in format and topics ultimately used throughout the course. While we provide 13 turnkey projects, it is only expected that 3 or 4 are used over the course of a semester, and all projects are provided both as textual instructions (the student version of this OER) and Jupyter Notebooks (one with and one without the solutions). It is up to the instructor to choose the most efficient platform according to the context of the class and technical constraints. Not all projects are created equal: they all assume some degree of proficiency in certain aspects of programming and provide practice in other aspects. For Instructor’s Version, please contact editor of the book Mathieu Sassolas at [email protected]

Functional impairment of systemic scleroderma patients with digital ulcerations: results from the DUO Registry

OBJECTIVES: Digital ulcers (DUs) are frequent manifestations of systemic scleroderma (SSc). This study assessed functional limitations due to DUs among patients enrolled in the Digital Ulcer Outcome (DUO) Registry, an international, multicentre, observational registry of SSc patients with DU disease. METHODS: Patients completed at enrolment a DU-specific functional assessment questionnaire with a 1-month recall period, measuring impairment in work and daily activities, and hours of help needed from others. Physician-reported clinical parameters were used to describe the population. For patients who completed at least part of the questionnaire, descriptive analyses were performed for overall results, and stratified by number of DUs at enrolment. RESULTS: This study included 2327 patients who completed at least part of the questionnaire. For patients with 0, 1–2, and ≥3 DUs at enrolment, mean overall work impairment during the prior month among employed/self-employed patients was 28%, 42%, and 48%, respectively. Across all included patients, ability to perform daily activities was impaired on average by 35%, 54%, and 63%, respectively. Patients required a mean of 2.0, 8.7, and 8.8 hours of paid help and 17.0, 35.9, and 63.7 hours of unpaid help, respectively, due to DUs in the prior month. Patients with DUs had more complications and medication use than patients with no DUs. CONCLUSIONS: With increasing number of DUs, SSc patients reported more impairment in work and daily activities and required more support from others

Search for high-energy neutrinos from gravitational wave event GW151226 and candidate LVT151012 with ANTARES and IceCube

The Advanced LIGO observatories detected gravitational waves from two binary black hole mergers during their first observation run (O1). We present a high-energy neutrino follow-up search for the second gravitational wave event, GW151226, as well as for gravitational wave candidate LVT151012. We find two and four neutrino candidates detected by IceCube, and one and zero detected by Antares, within ±500 s around the respective gravitational wave signals, consistent with the expected background rate. None of these neutrino candidates are found to be directionally coincident with GW151226 or LVT151012. We use nondetection to constrain isotropic-equivalent high-energy neutrino emission from GW151226, adopting the GW event's 3D localization, to less than 2×1051-2×1054 erg. © 2017 American Physical Society

Méthodes qualitatives et quantitatives pour la détection d'information cachée

Information systems have become ubiquitous and are used to handle each day more and more data. This data is increasingly confidential: strategic military or financial information, or private data. Any leakage of this data can be harmful in many different ways, such that human casualties, money loss, privacy breaching or identity theft. The contributions of this thesis are threefold. First, we study the problem of synthesis of a communication channel inside a system given as a transducer. Even though the model of transducers is syntactically limiting, we show that this synthesis problem is undecidable in general. However, when the system is functional, meaning that its behavior from an external point of view is always the same, the problem becomes decidable. We then generalize the concept of opacity to probabilistic systems, by giving measures separated in two groups. When the system is opaque, we evaluate the robustness of this opacity with respect to the bias induced by the probability distributions in the system. When the system is not opaque, we evaluate the size of the security hole opened by this non-opacity. Finally, we study the model of Interrupt Timed Automata (ITA) where information about time elapsing is organized along levels, which therefore resemble accreditation levels. We study properties of regularity and closure of the time languages accepted by these automata and give some model-checking algorithms for fragments of timed temporal logics.Les systèmes informatiques sont devenus omniprésents et sont utilisés au quotidien pour gérer toujours plus d'information. Ces informations sont de plus en plus souvent confidentielles: informations stratégiques militaires ou financières, données personnelles. La fuite de ces informations peut ainsi avoir des conséquences graves telles que des pertes humaines, financières, des violations de la vie privée ou de l'usurpation d'identité. Les contributions de cette thèse se découpent en trois parties. Tout d'abord, nous étudions le problème de synthèse d'un canal de communication dans un système décrit par un transducteur. Malgré les limites imposées par ce modèle, nous montrons que le problème de synthèse est indécidable en général. Cependant, lorsque le système est fonctionnel, c'est-à-dire que son fonctionnement externe est toujours le même, le problème devient décidable. Nous généralisons ensuite le concept d'opacité aux systèmes probabilistes, en donnant des mesures groupées en deux familles. Lorsque le système est opaque, nous évaluons la robustesse de cette opacité vis-à-vis des informations données par les lois de probabilités du système. Lorsque le système n'est pas opaque, nous évaluons la taille de la faille de sécurité induite par cette non opacité. Enfin, nous étudions le modèle des automates temporisés à interruptions (ITA) où les informations sur l'écoulement du temps sont organisées en niveaux comparables à des niveaux d'accréditation. Nous étudions les propriétés de régularité et de clôture des langages temporisés générés par ces automates et proposons des algorithmes de model-checking pour des fragments de logiques temporelles temporisées