Abstractions of non-interference security: probabilistic versus possibilistic

DOI10.1007/S00165-012-0237-4MaRDI QIDQ2018754zbMATH OpenOpenAlexFDO

Authors Thai Son Hoang, Carroll Morgan, A. Sloane, 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

zbMATH Keywords

program semanticsprogram refinementnon-interference securityprobabilistic non-interference

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Compositional noninterference from first principles
• Security invariants in discrete transition systems
• Compositional closure for Bayes risk in probabilistic noninterference
• On quantitative analysis of probabilistic protocols
• Computational probabilistic non-interference

Cites work

• scientific article; zbMATH DE number 3980105 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 503243 (Why is no real title available?)
• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• scientific article; zbMATH DE number 1962910 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• A Mathematical Theory of Communication
• A proof system for information flow security
• A semantic approach to secure information flow
• A theoretical basis for stepwise refinement and the programming calculus
• Compositional closure for Bayes risk in probabilistic noninterference
• Compositional refinement in agent-based security protocols
• Computational probabilistic non-interference
• Computing the leakage of information-hiding systems
• Hidden-Markov program algebra with iteration
• Information theory and security: Quantitative information flow
• On the security of public key protocols
• Preservation of probabilistic information flow under refinement
• Private information retrieval
• Refinement Calculus
• The B-Book
• The Secret Art of Computer Programming
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• The Thousand-and-One Cryptographers
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The random oracle methodology, revisited.
• The shadow knows: refinement and security in sequential programs

Cited in

(7)

• Abstract non-interference
• Compositional closure for Bayes risk in probabilistic noninterference
• Compositional noninterference from first principles
• The shadow knows: refinement and security in sequential programs
• Characterizing intransitive noninterference for 3-domain security policies with observability
• Security invariants in discrete transition systems
• Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents

Describes a project that uses

Uses Software

• Rodin
• ProVerif

This page was built for publication: Abstractions of non-interference security: probabilistic versus possibilistic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018754)