Abstract channels and their robust information-leakage ordering

DOI10.1007/978-3-642-54792-8_5MaRDI QIDQ5498749zbMATH OpenOpenAlexFDO

Authors

Publication date 10 February 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54792-8_5

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Channel models (including quantum) in information and communication theory (94A40) Computer security (68M25)

Recommendations

• Recent developments in quantitative information flow (invited tutorial)
• On the Compositionality of Quantitative Information Flow
• Information flow in interactive systems
• On the Additive Capacity Problem for Quantitative Information Flow
• Quantifying information leakage in process calculi

Cited in

(9)

• Quantifying Vulnerability of Secret Generation Using Hyper-Distributions
• An algebraic approach for reasoning about information flow
• A better composition operator for quantitative information flow analyses
• Hypernormalisation in an abstract setting
• Algebra for quantitative information flow
• Quantifying leakage in the presence of unreliable sources of information
• Quantifying information leakage of randomized protocols
• An axiomatization of information flow measures
• A demonic lattice of information

This page was built for publication: Abstract channels and their robust information-leakage ordering

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