Abstract Channels and Their Robust Information-Leakage Ordering
From MaRDI portal
Publication:5498749
DOI10.1007/978-3-642-54792-8_5zbMath1461.68081OpenAlexW182286721MaRDI QIDQ5498749
No author found.
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
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)
Related Items (8)
Quantifying leakage in the presence of unreliable sources of information ⋮ Algebra for Quantitative Information Flow ⋮ A better composition operator for quantitative information flow analyses ⋮ An axiomatization of information flow measures ⋮ Hypernormalisation in an abstract setting ⋮ Quantifying Vulnerability of Secret Generation Using Hyper-Distributions ⋮ An algebraic approach for reasoning about information flow ⋮ Quantifying information leakage of randomized protocols
This page was built for publication: Abstract Channels and Their Robust Information-Leakage Ordering