Attachement amoureux et comportements suicidaires dans un contexte de rupture amoureuse

Les ruptures amoureuses et les divorces sont très fréquents dans la société actuelle. La rupture d’une relation amoureuse est une épreuve difficile (Holmes & Rahe, 1967; Scully, Tosi, & Banning, 2000) qui génère une détresse émotionnelle importante (Birnbaum, Orr, Mikulincer, & Florian, 1997; Sbarra, 2006). Certains individus qui vivent une rupture iront même jusqu’à poser un geste suicidaire. En effet, le lien entre la rupture amoureuse et le comportement suicidaire est bien documenté à ce jour (Ide, Wyder, Kolves, & De Leo, 2010). La présente étude a investigué le rôle des insécurités d’attachement amoureux (anxiété d’abandon, évitement de l’intimité) dans la survenue des symptômes dépressifs et des comportements suicidaires (pensées et tentatives) à la suite d’une rupture. Pour ce faire, 50 participants adultes ayant vécu une rupture amoureuse dans les six derniers mois ont été recrutés auprès d’organismes d’aide (centre de prévention de suicide, centre psychologique, organisme communautaire), ainsi qu’à l’aide de publicités affichées en milieu universitaire, sur les réseaux sociaux et sur des réseaux de partenaires. Un intervenant formé en crise suicidaire a administré verbalement des questionnaires validés d’attachement amoureux, de symptômes dépressifs et de comportements suicidaires lors d’une entrevue individuelle. Les résultats des analyses de régressions multiples ont montré que l’anxiété d’abandon des adultes qui vivent une rupture est liée à davantage de symptômes dépressifs, ainsi qu’à la sévérité et l’intensité des idées suicidaires. Ces effets demeurent lorsque l’utilisation du réseau social est contrôlée. L’évitement de l’intimité n’est pas lié à ces variables. La discussion porte sur l’importance de l’anxiété d’abandon comme facteur de vulnérabilité dans les difficultés d’adaptation à la rupture, au-delà du réseau social, et propose des pistes d’évaluation et d’intervention pour les cliniciens.

Représentations d'attachement mère-enfant et troubles anxieux pendant l'enfance: une étude de cas multiples

Les troubles anxieux et les symptômes associés s’avèrent être reconnus comme l’une des formes de psychopathologies vécues le plus fréquemment chez les enfants et les adolescents (Costello, Mustillo, Erkanli, Keeler, & Angold, 2003). Le degré de sécurité d’attachement est considéré depuis longtemps comme un facteur ayant une influence fondamentale sur le développement de l’enfant et dans l’émergence de psychopathologie (DeKlyen & Greenberg, 2008; Kobak, Cassidy, Lyons-Ruth, & Zir, 2006), s’avérant ainsi une variable importante pour comprendre l’émergence des troubles anxieux pendant l’enfance (Colonnesi et al., 2011). La présente étude de cas multiples s’avère la première à utiliser des mesures représentationnelles afin d’observer l’attachement auprès d’une population clinique d’enfants d’âge scolaire ayant un trouble anxieux (Child Attachment Interview) et chez leur mère (Adult Attachment Interview). Trois principaux objectifs, tous de nature exploratoire, sont visés: 1) procéder à une analyse approfondie des profils d’attachement chez les enfants ayant un trouble anxieux et leur mère, tant sur le plan des catégories que des dimensions d’attachement; 2) décrire les correspondances entre les représentations d’attachement de la mère et de son enfant; 3) examiner les associations entre les types de représentations d’attachement mère-enfant et les types de symptômes anxieux chez l’enfant. Pour ce faire, des mesures de ces deux variables ont été prises auprès de six enfants âgés entre 8 et 15 ans et leurs mères, recrutés au sein d’une clinique de troisième ligne spécialisée en traitement des troubles anxieux. Les résultats démontrent que la majorité des enfants ayant un trouble anxieux présente une insécurité des représentations d’attachement, accompagnée principalement d’une tendance à l’attachement détaché. Concernant les dimensions d’attachement, la majorité des enfants anxieux présente d’importants déficits liés à l’ouverture émotionnelle. De plus, toutes les mères présentent des représentations d’attachement se situant sur le continuum de la préoccupation, impliquant des stratégies d’hyperactivation (de modérées à élevées). Les mères des enfants ayant un attachement sécurisant composent avec des représentations d’attachement préoccupées par des évènements traumatiques. Ensuite, peu de correspondances intergénérationnelles sont observables. Une tendance à présenter des stratégies d’attachement complémentaires est plutôt relevée, particulièrement concernant des stratégies d’hyperactivation chez la mère (pôle préoccupé) et de désactivation chez l’enfant (pôle détaché). Par ailleurs, peu d’associations spécifiques sont identifiées entre les représentations d’attachement et les troubles anxieux, mis à part la présence d’insécurité chez les enfants ayant un trouble d’anxiété de séparation. Enfin, une importante tendance aux difficultés d’ordre psychosomatique est observée chez les enfants ayant un trouble anxieux. À la lumière de ces principales tendances relatives à l’attachement, des pistes cliniques seront proposées afin de soutenir l’intervention des équipes traitantes auprès des enfants composant avec un trouble anxieux et de leur mère.

Secure, dynamic and distributed access control stack for database applications

In database applications, access control security layers are mostly developed from tools provided by vendors of database management systems and deployed in the same servers containing the data to be protected. This solution conveys several drawbacks. Among them we emphasize: 1) if policies are complex, their enforcement can lead to performance decay of database servers; 2) when modifications in the established policies implies modifications in the business logic (usually deployed at the client-side), there is no other possibility than modify the business logic in advance and, finally, 3) malicious users can issue CRUD expressions systematically against the DBMS expecting to identify any security gap. In order to overcome these drawbacks, in this paper we propose an access control stack characterized by: most of the mechanisms are deployed at the client-side; whenever security policies evolve, the security mechanisms are automatically updated at runtime and, finally, client-side applications do not handle CRUD expressions directly. We also present an implementation of the proposed stack to prove its feasibility. This paper presents a new approach to enforce access control in database applications, this way expecting to contribute positively to the state of the art in the field.

Secure, dynamic and distributed access control stack for database applications

In database applications, access control security layers are mostly developed from tools provided by vendors of database management systems and deployed in the same servers containing the data to be protected. This solution conveys several drawbacks. Among them we emphasize: (1) if policies are complex, their enforcement can lead to performance decay of database servers; (2) when modifications in the established policies implies modifications in the business logic (usually deployed at the client-side), there is no other possibility than modify the business logic in advance and, finally, 3) malicious users can issue CRUD expressions systematically against the DBMS expecting to identify any security gap. In order to overcome these drawbacks, in this paper we propose an access control stack characterized by: most of the mechanisms are deployed at the client-side; whenever security policies evolve, the security mechanisms are automatically updated at runtime and, finally, client-side applications do not handle CRUD expressions directly. We also present an implementation of the proposed stack to prove its feasibility. This paper presents a new approach to enforce access control in database applications, this way expecting to contribute positively to the state of the art in the field.

Language-based Techniques for Practical and Trustworthy Secure Multi-party Computations

Secure Multi-party Computation (MPC) enables a set of parties to collaboratively compute, using cryptographic protocols, a function over their private data in a way that the participants do not see each other's data, they only see the final output. Typical MPC examples include statistical computations over joint private data, private set intersection, and auctions. While these applications are examples of monolithic MPC, richer MPC applications move between "normal" (i.e., per-party local) and "secure" (i.e., joint, multi-party secure) modes repeatedly, resulting overall in mixed-mode computations. For example, we might use MPC to implement the role of the dealer in a game of mental poker -- the game will be divided into rounds of local decision-making (e.g. bidding) and joint interaction (e.g. dealing). Mixed-mode computations are also used to improve performance over monolithic secure computations. Starting with the Fairplay project, several MPC frameworks have been proposed in the last decade to help programmers write MPC applications in a high-level language, while the toolchain manages the low-level details. However, these frameworks are either not expressive enough to allow writing mixed-mode applications or lack formal specification, and reasoning capabilities, thereby diminishing the parties' trust in such tools, and the programs written using them. Furthermore, none of the frameworks provides a verified toolchain to run the MPC programs, leaving the potential of security holes that can compromise the privacy of parties' data. This dissertation presents language-based techniques to make MPC more practical and trustworthy. First, it presents the design and implementation of a new MPC Domain Specific Language, called Wysteria, for writing rich mixed-mode MPC applications. Wysteria provides several benefits over previous languages, including a conceptual single thread of control, generic support for more than two parties, high-level abstractions for secret shares, and a fully formalized type system and operational semantics. Using Wysteria, we have implemented several MPC applications, including, for the first time, a card dealing application. The dissertation next presents Wys*, an embedding of Wysteria in F*, a full-featured verification oriented programming language. Wys* improves on Wysteria along three lines: (a) It enables programmers to formally verify the correctness and security properties of their programs. As far as we know, Wys* is the first language to provide verification capabilities for MPC programs. (b) It provides a partially verified toolchain to run MPC programs, and finally (c) It enables the MPC programs to use, with no extra effort, standard language constructs from the host language F*, thereby making it more usable and scalable. Finally, the dissertation develops static analyses that help optimize monolithic MPC programs into mixed-mode MPC programs, while providing similar privacy guarantees as the monolithic versions.

Efficient Secure Computation for Real-world Settings and Security Models

Secure computation involves multiple parties computing a common function while keeping their inputs private, and is a growing field of cryptography due to its potential for maintaining privacy guarantees in real-world applications. However, current secure computation protocols are not yet efficient enough to be used in practice. We argue that this is due to much of the research effort being focused on generality rather than specificity. Namely, current research tends to focus on constructing and improving protocols for the strongest notions of security or for an arbitrary number of parties. However, in real-world deployments, these security notions are often too strong, or the number of parties running a protocol would be smaller. In this thesis we make several steps towards bridging the efficiency gap of secure computation by focusing on constructing efficient protocols for specific real-world settings and security models. In particular, we make the following four contributions: - We show an efficient (when amortized over multiple runs) maliciously secure two-party secure computation (2PC) protocol in the multiple-execution setting, where the same function is computed multiple times by the same pair of parties. - We improve the efficiency of 2PC protocols in the publicly verifiable covert security model, where a party can cheat with some probability but if it gets caught then the honest party obtains a certificate proving that the given party cheated. - We show how to optimize existing 2PC protocols when the function to be computed includes predicate checks on its inputs. - We demonstrate an efficient maliciously secure protocol in the three-party setting.

Modernizing Secure OLAP Applications with a Model-Driven Approach

The majority of the organizations store their historical business information in data warehouses which are queried to make strategic decisions by using online analytical processing (OLAP) tools. This information has to be correctly assured against unauthorized accesses, but nevertheless there are a great amount of legacy OLAP applications that have been developed without considering security aspects or these have been incorporated once the system was implemented. This work defines a reverse engineering process that allows us to obtain the conceptual model corresponding to a legacy OLAP application, and also analyses and represents the security aspects that could have established. This process has been aligned with a model-driven architecture for developing secure OLAP applications by defining the transformations needed to automatically apply it. Once the conceptual model has been extracted, it can be easily modified and improved with security, and automatically transformed to generate the new implementation.

«Programme d'Intervention Relationnelle» : programme d'intervention visant l'amélioration de la relation d'attachement entre le parent et son enfant, en contexte de négligence sous la Direction de la Protection de la Jeunesse

Rapport d'analyse d'intervention présenté à la Faculté des arts et sciences en vue de l'obtention du grade de Maîtrise ès sciences (M. Sc.) en psychoéducation.

Secure and Privacy-aware Data Collection and Processing in Mobile Health Systems

Healthcare systems have assimilated information and communication technologies in order to improve the quality of healthcare and patient's experience at reduced costs. The increasing digitalization of people's health information raises however new threats regarding information security and privacy. Accidental or deliberate data breaches of health data may lead to societal pressures, embarrassment and discrimination. Information security and privacy are paramount to achieve high quality healthcare services, and further, to not harm individuals when providing care. With that in mind, we give special attention to the category of Mobile Health (mHealth) systems. That is, the use of mobile devices (e.g., mobile phones, sensors, PDAs) to support medical and public health. Such systems, have been particularly successful in developing countries, taking advantage of the flourishing mobile market and the need to expand the coverage of primary healthcare programs. Many mHealth initiatives, however, fail to address security and privacy issues. This, coupled with the lack of specific legislation for privacy and data protection in these countries, increases the risk of harm to individuals. The overall objective of this thesis is to enhance knowledge regarding the design of security and privacy technologies for mHealth systems. In particular, we deal with mHealth Data Collection Systems (MDCSs), which consists of mobile devices for collecting and reporting health-related data, replacing paper-based approaches for health surveys and surveillance. This thesis consists of publications contributing to mHealth security and privacy in various ways: with a comprehensive literature review about mHealth in Brazil; with the design of a security framework for MDCSs (SecourHealth); with the design of a MDCS (GeoHealth); with the design of Privacy Impact Assessment template for MDCSs; and with the study of ontology-based obfuscation and anonymisation functions for health data.

Structured professional judgement approach to risk assessment: generalisability across patient groups for the prediction of adverse outcomes in secure mental health care

This is a redacted version of the the final thesis. Copyright material has been removed to comply with UK Copyright Law.

«Programme d'Intervention Relationnelle» : programme d'intervention visant l'amélioration de la relation d'attachement entre le parent et son enfant, en contexte de négligence sous la Direction de la Protection de la Jeunesse

Rapport d'analyse d'intervention présenté à la Faculté des arts et sciences en vue de l'obtention du grade de Maîtrise ès sciences (M. Sc.) en psychoéducation.

Making Board Meetings More Secure and Efficient: Purging the Paper

The Division of Professional and Occupational Licensing is an administrative unit within the Department of Labor, Licensing, and Regulation that provides support to 40 professional and occupational regulatory boards. All board members need documents to review during the meeting. Some boards use a fleet of dated laptops during the meetings to give board members the meeting materials in PDF format; however many of boards still print the meeting materials and put them into binders. .In today's age, there has to be a more efficient way to conduct meetings without all of the paper. This paper explores alternatives to paper and laptops for use at these meetings. It was concluded that a tablet with a Windows Operating System would be the best way to go.