The complexity of quantitative information flow in recursive programs

DOI10.4230/LIPICS.FSTTCS.2012.534MaRDI QIDQ2957526zbMATH OpenOpenAlexFDO

Authors Rohit Chadha, Michael Ummels

Publication date 26 January 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2012/3887/pdf/48.pdf

zbMATH Keywords

computational complexityprogram analysisquantitative information flowrecursive programsverification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

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

Cited in

(7)

• Sampling automata and programs
• The complexity of synchronous notions of information flow security
• Quantified interference for a while language
• Assessing security threats of looping constructs
• Scalable approximation of quantitative information flow in programs
• scientific article; zbMATH DE number 922628 (Why is no real title available?)
• Upper bound computation of information leakages for unbounded recursion

This page was built for publication: The complexity of quantitative information flow in recursive programs

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