Algebra for Quantitative Information Flow
DOI10.1007/978-3-319-57418-9_1zbMath1486.68044OpenAlexW2607923323MaRDI QIDQ5283199
Tahiry Rabehaja, Carroll Morgan, Annabelle McIver
Publication date: 21 July 2017
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57418-9_1
monotonicitysecurityrefinementinformation flowcompositional reasoningprobabilistic semanticsDalenius desideratum
Semantics in the theory of computing (68Q55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
- Compositional Closure for Bayes Risk in Probabilistic Noninterference
- On the Foundations of Quantitative Information Flow
- The Shadow Knows: Refinement of Ignorance in Sequential Programs
- Refinement Calculus
- Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow
- Abstraction, Refinement and Proof for Probabilistic Systems
- Abstract Channels and Their Robust Information-Leakage Ordering
- Hidden-Markov program algebra with iteration
- Differential Privacy
This page was built for publication: Algebra for Quantitative Information Flow