Quantitative notions of leakage for one-try attacks

DOI10.1016/J.ENTCS.2009.07.085MaRDI QIDQ2805152zbMATH OpenOpenAlexFDO

Authors Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi

Publication date 10 May 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.07.085

zbMATH Keywords

hypothesis testingprobability of errorinformation-hidingRényi min-entropy

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• On the Foundations of Quantitative Information Flow
• Asymptotic information leakage under one-try attacks
• Asymptotic information leakage under one-try attacks
• Recent developments in quantitative information flow (invited tutorial)
• Quantitative information flow, with a view

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• Anonymity protocols as noisy channels
• Assessing security threats of looping constructs
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• On the Foundations of Quantitative Information Flow
• Quantitative Information Flow, Relations and Polymorphic Types

Cited in

(21)

• Hidden-Markov program algebra with iteration
• Asymptotic information leakage under one-try attacks
• A Unified Metric for Quantifying Information Leakage of Cryptographic Devices Under Power Analysis Attacks
• Generalized differential privacy: regions of priors that admit robust optimal mechanisms
• A primer on alpha-information theory with application to leakage in secrecy systems
• Information hiding in probabilistic concurrent systems
• Information theory and security: Quantitative information flow
• On the relation between differential privacy and quantitative information flow
• An algebraic approach for reasoning about information flow
• A better composition operator for quantitative information flow analyses
• Quantitative information flow for scheduler-dependent systems
• Asymptotic information leakage under one-try attacks
• Searching secrets rationally
• On the Foundations of Quantitative Information Flow
• Analyzing anonymity attacks through noisy channels
• On the Additive Capacity Problem for Quantitative Information Flow
• Quantifying leakage in the presence of unreliable sources of information
• Quantitative information flow as safety and liveness hyperproperties
• Masking primal and dual models for data privacy in network revenue management
• Min-entropy as a resource
• Worst- and average-case privacy breaches in randomization mechanisms

This page was built for publication: Quantitative notions of leakage for one-try attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805152)