A better composition operator for quantitative information flow analyses

DOI10.1007/978-3-319-66402-6_26zbMath1496.68061OpenAlexW2745128941MaRDI QIDQ2167722

Kai Engelhardt

Publication date: 25 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-66402-6_26

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items (1)

An algebraic approach for reasoning about information flow

Cites Work

• Unnamed Item
• Unnamed Item
• Min-entropy as a resource
• Probabilistic rely-guarantee calculus
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Quantitative Notions of Leakage for One-try Attacks
• Compositional Closure for Bayes Risk in Probabilistic Noninterference
• Knowledge, probability, and adversaries
• Recent Developments in Quantitative Information Flow (Invited Tutorial)
• Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow
• A logical approach to multilevel security of probabilistic systems
• Transforming out timing leaks
• On the Compositionality of Quantitative Information Flow
• CakeML
• Abstract Channels and Their Robust Information-Leakage Ordering
• Hidden-Markov program algebra with iteration

This page was built for publication: A better composition operator for quantitative information flow analyses