Abstractions of non-interference security: probabilistic versus possibilistic
From MaRDI portal
Publication:2018754
DOI10.1007/s00165-012-0237-4zbMath1323.68212OpenAlexW2005567332MaRDI QIDQ2018754
A. Sloane, Thai Son Hoang, Carroll Morgan, E. Susatyo, Annabelle McIver, Larissa A. Meinicke
Publication date: 25 March 2015
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-012-0237-4
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Compositional refinement in agent-based security protocols
- A theoretical basis for stepwise refinement and the programming calculus
- The shadow knows: refinement and security in sequential programs
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- A semantic approach to secure information flow
- Preservation of probabilistic information flow under refinement
- The random oracle methodology, revisited
- A Proof System for Information Flow Security
- Private information retrieval
- The Thousand-and-One Cryptographers
- The Secret Art of Computer Programming
- Computing the Leakage of Information-Hiding Systems
- Information Theory and Security: Quantitative Information Flow
- Compositional Closure for Bayes Risk in Probabilistic Noninterference
- The Shadow Knows: Refinement of Ignorance in Sequential Programs
- On the security of public key protocols
- The B-Book
- Refinement Calculus
- Computational Probabilistic Non-interference
- Hidden-Markov program algebra with iteration
This page was built for publication: Abstractions of non-interference security: probabilistic versus possibilistic
