377 research outputs found

    Information Leakage Games

    Full text link
    We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a mixed strategy is a convex function of the distribution on the defender's pure actions, rather than the expected value of their utilities. Nevertheless, the important properties of game theory, notably the existence of a Nash equilibrium, still hold for our (zero-sum) leakage games, and we provide algorithms to compute the corresponding optimal strategies. As typical in (simultaneous) game theory, the optimal strategy is usually mixed, i.e., probabilistic, for both the attacker and the defender. From the point of view of information flow, this was to be expected in the case of the defender, since it is well known that randomization at the level of the system design may help to reduce information leaks. Regarding the attacker, however, this seems the first work (w.r.t. the literature in information flow) proving formally that in certain cases the optimal attack strategy is necessarily probabilistic

    Should We Learn Probabilistic Models for Model Checking? A New Approach and An Empirical Study

    Get PDF
    Many automated system analysis techniques (e.g., model checking, model-based testing) rely on first obtaining a model of the system under analysis. System modeling is often done manually, which is often considered as a hindrance to adopt model-based system analysis and development techniques. To overcome this problem, researchers have proposed to automatically "learn" models based on sample system executions and shown that the learned models can be useful sometimes. There are however many questions to be answered. For instance, how much shall we generalize from the observed samples and how fast would learning converge? Or, would the analysis result based on the learned model be more accurate than the estimation we could have obtained by sampling many system executions within the same amount of time? In this work, we investigate existing algorithms for learning probabilistic models for model checking, propose an evolution-based approach for better controlling the degree of generalization and conduct an empirical study in order to answer the questions. One of our findings is that the effectiveness of learning may sometimes be limited.Comment: 15 pages, plus 2 reference pages, accepted by FASE 2017 in ETAP

    Bounded Model Checking for Probabilistic Programs

    Get PDF
    In this paper we investigate the applicability of standard model checking approaches to verifying properties in probabilistic programming. As the operational model for a standard probabilistic program is a potentially infinite parametric Markov decision process, no direct adaption of existing techniques is possible. Therefore, we propose an on-the-fly approach where the operational model is successively created and verified via a step-wise execution of the program. This approach enables to take key features of many probabilistic programs into account: nondeterminism and conditioning. We discuss the restrictions and demonstrate the scalability on several benchmarks

    Accelerated Model Checking of Parametric Markov Chains

    Get PDF
    Parametric Markov chains occur quite naturally in various applications: they can be used for a conservative analysis of probabilistic systems (no matter how the parameter is chosen, the system works to specification); they can be used to find optimal settings for a parameter; they can be used to visualise the influence of system parameters; and they can be used to make it easy to adjust the analysis for the case that parameters change. Unfortunately, these advancements come at a cost: parametric model checking is---or rather was---often slow. To make the analysis of parametric Markov models scale, we need three ingredients: clever algorithms, the right data structure, and good engineering. Clever algorithms are often the main (or sole) selling point; and we face the trouble that this paper focuses on -- the latter ingredients to efficient model checking. Consequently, our easiest claim to fame is in the speed-up we have often realised when comparing to the state of the art

    The effectiveness of public health interventions to reduce the health impact of climate change:a systematic review of systematic reviews

    Get PDF
    Climate change is likely to be one of the most important threats to public health in the coming years. Yet despite the large number of papers considering the health impact of climate change, few have considered what public health interventions may be of most value in reducing the disease burden. We aimed to evaluate the effectiveness of public health interventions to reduce the disease burden of high priority climate sensitive diseases

    A922 Sequential measurement of 1 hour creatinine clearance (1-CRCL) in critically ill patients at risk of acute kidney injury (AKI)

    Get PDF
    Meeting abstrac

    An affinity matured minibody for PET imaging of prostate stem cell antigen (PSCA)-expressing tumors

    Get PDF
    PurposeProstate stem cell antigen (PSCA), a cell surface glycoprotein expressed in normal human prostate and bladder, is over-expressed in the majority of localized prostate cancer and most bone metastases. We have previously shown that the hu1G8 minibody, a humanized anti-PSCA antibody fragment (single-chain Fv-C(H)3 dimer, 80 kDa), can localize specifically and image PSCA-expressing xenografts at 21 h post-injection. However, the humanization and antibody fragment reformatting decreased its apparent affinity. Here, we sought to evaluate PET imaging contrast with affinity matured minibodies.MethodsYeast scFv display, involving four rounds of selection, was used to generate the three affinity matured antibody fragments (A2, A11, and C5) that were reformatted into minibodies. These three affinity matured anti-PSCA minibodies were characterized in vitro, and following radiolabeling with (124)I were evaluated in vivo for microPET imaging of PSCA-expressing tumors.ResultsThe A2, A11, and C5 minibody variants all demonstrated improved affinity compared to the parental (P) minibody and were ranked as follows: A2 > A11 > C5 > P. The (124)I-labeled A11 minibody demonstrated higher immunoreactivity than the parental minibody and also achieved the best microPET imaging contrast in two xenograft models, LAPC-9 (prostate cancer) and Capan-1 (pancreatic cancer), when evaluated in vivo.ConclusionOf the affinity variant minibodies tested, the A11 minibody that ranked second in affinity was selected as the best immunoPET tracer to image PSCA-expressing xenografts. This candidate is currently under development for evaluation in a pilot clinical imaging study

    On the Security Properties of e-Voting Bulletin Boards

    Get PDF
    In state-of-the-art e-voting systems, a bulletin board (BB) is a critical component for preserving election integrity and availability. Although it is common in the literature to assume that a BB is a centralized entity that is trusted, in the recent works of Culnane and Schneider [CSF 2014] and Chondros et al. [ICDCS 2016], the importance of removing BB as a single point of failure has been extensively discussed. Motivated by these works, we introduce a framework for the formal security analysis of the BB functionality. Our framework treats a secure BB as a robust public transaction ledger, defined by Garay et al. [Eurocrypt 2015], that additionally supports the generation of receipts for successful posting. Namely, in our model, a secure BB system achieves Persistence and Liveness that are confirmable, in the sense that any malicious behavior of the BB system can be detected via a verification mechanism.As a case study for our framework, we analyze the BB system of Culnane and Schneider and point out its weaknesses. We demonstrate an attack revealing that the said system does not achieve Confirmable Liveness, even in the case where the adversary is computationally bounded and covert, i.e., it may deviate from the protocol specification but does not want to be detected. In addition, we show that special care should be taken for the choice of the underlying cryptographic primitives, so that the claimed fault tolerance threshold of N=3 out-of N corrupted peers is preserved. Next, based on our analysis, we introduce a new BB protocol that upgrades the [CSF 2014] protocol. We prove that it tolerates any number less than N=3 out-of N corrupted peers both for Persistence and Confirmable Liveness, against a computationally bounded general Byzantine adversary.<br/

    Direct cooling of the catheter tip increases safety for CMR-guided electrophysiological procedures

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>One of the safety concerns when performing electrophysiological (EP) procedures under magnetic resonance (MR) guidance is the risk of passive tissue heating due to the EP catheter being exposed to the radiofrequency (RF) field of the RF transmitting body coil. Ablation procedures that use catheters with irrigated tips are well established therapeutic options for the treatment of cardiac arrhythmias and when used in a modified mode might offer an additional system for suppressing passive catheter heating.</p> <p>Methods</p> <p>A two-step approach was chosen. Firstly, tests on passive catheter heating were performed in a 1.5 T Avanto system (Siemens Healthcare Sector, Erlangen, Germany) using a ASTM Phantom in order to determine a possible maximum temperature rise. Secondly, a phantom was designed for simulation of the interface between blood and the vascular wall. The MR-RF induced temperature rise was simulated by catheter tip heating via a standard ablation generator. Power levels from 1 to 6 W were selected. Ablation duration was 120 s with no tip irrigation during the first 60 s and irrigation at rates from 2 ml/min to 35 ml/min for the remaining 60 s (Biotronik Qiona Pump, Berlin, Germany). The temperature was measured with fluoroscopic sensors (Luxtron, Santa Barbara, CA, USA) at a distance of 0 mm, 2 mm, 4 mm, and 6 mm from the catheter tip.</p> <p>Results</p> <p>A maximum temperature rise of 22.4°C at the catheter tip was documented in the MR scanner. This temperature rise is equivalent to the heating effect of an ablator's power output of 6 W at a contact force of the weight of 90 g (0.883 N). The catheter tip irrigation was able to limit the temperature rise to less than 2°C for the majority of examined power levels, and for all examined power levels the residual temperature rise was less than 8°C.</p> <p>Conclusion</p> <p>Up to a maximum of 22.4°C, the temperature rise at the tissue surface can be entirely suppressed by using the catheter's own irrigation system. The irrigated tip system can be used to increase MR safety of EP catheters by suppressing the effects of unwanted passive catheter heating due to RF exposure from the MR scanner.</p

    Phosphorylation-Independent Regulation of Atf1-Promoted Meiotic Recombination by Stress-Activated, p38 Kinase Spc1 of Fission Yeast

    Get PDF
    BACKGROUND:Stress-activated protein kinases regulate multiple cellular responses to a wide variety of intracellular and extracellular conditions. The conserved, multifunctional, ATF/CREB protein Atf1 (Mts1, Gad7) of fission yeast binds to CRE-like (M26) DNA sites. Atf1 is phosphorylated by the conserved, p38-family kinase Spc1 (Sty1, Phh1) and is required for many Spc1-dependent stress responses, efficient sexual differentiation, and activation of Rec12 (Spo11)-dependent meiotic recombination hotspots like ade6-M26. METHODOLOGY/PRINCIPAL FINDINGS:We sought to define mechanisms by which Spc1 regulates Atf1 function at the ade6-M26 hotspot. The Spc1 kinase was essential for hotspot activity, but dispensable for basal recombination. Unexpectedly, a protein lacking all eleven MAPK phospho-acceptor sites and detectable phosphorylation (Atf1-11M) was fully proficient for hotspot recombination. Furthermore, tethering of Atf1 to ade6 in the chromosome by a heterologous DNA binding domain bypassed the requirement for Spc1 in promoting recombination. CONCLUSIONS/SIGNIFICANCE:The Spc1 protein kinase regulates the pathway of Atf1-promoted recombination at or before the point where Atf1 binds to chromosomes, and this pathway regulation is independent of the phosphorylation status of Atf1. Since basal recombination is Spc1-independent, the principal function of the Spc1 kinase in meiotic recombination is to correctly position Atf1-promoted recombination at hotspots along chromosomes. We also propose new hypotheses on regulatory mechanisms for shared (e.g., DNA binding) and distinct (e.g., osmoregulatory vs. recombinogenic) activities of multifunctional, stress-activated protein Atf1
    corecore