Algebra for quantitative information flow
From MaRDI portal
monotonicityrefinementsecurityinformation flowcompositional reasoningprobabilistic semanticsDalenius desideratum
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Semantics in the theory of computing (68Q55)
Recommendations
Cites work
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 605806 (Why is no real title available?)
- A Kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
- Abstract channels and their robust information-leakage ordering
- Abstract hidden Markov models: a monadic account of quantitative information flow
- Abstraction, Refinement and Proof for Probabilistic Systems
- Compositional closure for Bayes risk in probabilistic noninterference
- Differential Privacy
- Hidden-Markov program algebra with iteration
- On the Foundations of Quantitative Information Flow
- Refinement Calculus
- The Shadow Knows: Refinement of Ignorance in Sequential Programs
Cited in
(5)
This page was built for publication: Algebra for quantitative information flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283199)