Precise quantitative information flow analysis -- a symbolic approach

DOI10.1016/J.TCS.2014.04.022MaRDI QIDQ2453114zbMATH OpenOpenAlexFDO

Authors Vladimir Klebanov

Publication date 6 June 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.04.022

zbMATH Keywords

securityinformation flowquantitative analysispolyhedral modelprogram specificationssymbolic model counting

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automation of quantitative information-flow analysis
• What's the over/under? Probabilistic bounds on information leakage
• Computing Information Flow Using Symbolic Model-Checking
• Information theory and security: Quantitative information flow
• Upper bound computation of information leakages for unbounded recursion

Cites work

• scientific article; zbMATH DE number 1759367 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• scientific article; zbMATH DE number 3246263 (Why is no real title available?)
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Compositional noninterference from first principles
• Counting integer points in parametric polytopes using Barvinok's rational functions
• First-order dynamic logic
• Handbook of signal processing systems. Foreword by S. Y. Kung
• Local Euler-Maclaurin formula for polytopes
• Loop summarization using state and transition invariants
• On the Foundations of Quantitative Information Flow
• Parametric integer programming
• Predicate Abstraction in a Program Logic Calculus
• Quantitative Information Flow, Relations and Polymorphic Types
• Static Analysis
• Statistical measurement of information leakage
• Tableaux for projection computation and knowledge compilation
• The Euler-Maclaurin and Taylor Formulas: Twin, Elementary Derivations

Cited in

(10)

• Upper bound computation of information leakages for unbounded recursion
• Scalable approximation of quantitative information flow in programs
• Combining symbolic and numerical domains for information leakage analysis
• What's the over/under? Probabilistic bounds on information leakage
• An automated quantitative information flow analysis for concurrent programs
• A better composition operator for quantitative information flow analyses
• Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy
• Computing Information Flow Using Symbolic Model-Checking
• Quantitative security analysis for multi-threaded programs
• Automation of quantitative information-flow analysis

Describes a project that uses

Uses Software

• PipLib

This page was built for publication: Precise quantitative information flow analysis -- a symbolic approach

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