Formal analysis of information flow in HOL

DOI10.1007/978-3-319-69483-2_17MaRDI QIDQ5045392zbMATH OpenOpenAlexFDO

Authors Ghassen Helali, Sofiène Tahar, Osman Hasan, Tsvetan Dunchev

Publication date 4 November 2022

Published in Dependable Software Engineering. Theories, Tools, and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-69483-2_17

zbMATH Keywords

entropyg-leakagegain functionhigher-order logicinformation flowtheorem proving

Mathematics Subject Classification ID

Computer security (68M25) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Formalization of mathematics in connection with theorem provers (68V20) Measures of information, entropy (94A17)

Recommendations

• Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy
• Formalization of entropy measures in HOL
• An axiomatization of information flow measures
• Information theory and security: Quantitative information flow
• Informational analysis of security and integrity

Cited in

(4)

• Formalization of Shannon's theorems in SSReflect-Coq
• Formalization of entropy measures in HOL
• Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy
• Static Analysis

This page was built for publication: Formal analysis of information flow in HOL

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