An algebraic approach for reasoning about information flow
From MaRDI portal
Publication:2024334
DOI10.1007/978-3-319-95582-7_4zbMath1460.68035arXiv1801.08090OpenAlexW2963106551MaRDI QIDQ2024334
Arthur Américo, Mário S. Alvim, Annabelle McIver
Publication date: 4 May 2021
Full work available at URL: https://arxiv.org/abs/1801.08090
Specification and verification (program logics, model checking, etc.) (68Q60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computer security (68M25)
Related Items (1)
Cites Work
- A Mathematical Theory of Communication
- Min-entropy as a resource
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- An algebraic approach for reasoning about information flow
- A better composition operator for quantitative information flow analyses
- Leakage and protocol composition in a game-theoretic perspective
- Gaussian elimination is not optimal
- Quantitative Notions of Leakage for One-try Attacks
- Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
- Quantitative Information Flow, Relations and Polymorphic Types
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Quantitative information flow under generic leakage functions and adaptive adversaries
- Computing the Leakage of Information-Hiding Systems
- Compositional Closure for Bayes Risk in Probabilistic Noninterference
- On the Foundations of Quantitative Information Flow
- On the Compositionality of Quantitative Information Flow
- Abstract Channels and Their Robust Information-Leakage Ordering
This page was built for publication: An algebraic approach for reasoning about information flow
