On the public citation graph
Quantitative Information Flow - Verification Hardness and Possibilities
0 signed · 89 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1007/11547662_24openalex-snapshot
Secure Information Flow as a Safety Problem
inferredcites →https://doi.org/10.1007/11817963_14openalex-snapshot
Lazy Abstraction with Interpolants
inferredcites →https://doi.org/10.1007/11863908_18openalex-snapshot
From Coupling Relations to Mated Invariants for Checking Information Flow
inferredcites →https://doi.org/10.1007/978-3-540-32004-3_20openalex-snapshot
A Theorem Proving Approach to Analysis of Secure Information Flow
inferredcites →https://doi.org/10.1007/978-3-540-37621-7_9openalex-snapshot
A Model for Delimited Information Release
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_21openalex-snapshot
On the Foundations of Quantitative Information Flow
inferredcites →https://doi.org/10.1007/s10009-007-0044-zopenalex-snapshot
The software model checker Blast
inferredcites →https://doi.org/10.1016/j.entcs.2004.01.018openalex-snapshot
Quantified Interference for a While Language
inferredcites →https://doi.org/10.1016/j.ipl.2004.10.015openalex-snapshot
Efficient weakest preconditions
inferredcites →https://doi.org/10.1093/logcom/exi009openalex-snapshot
Quantitative Information Flow, Relations and Polymorphic Types
inferredcites →https://doi.org/10.1109/csf.2010.9openalex-snapshot
Quantitative Information Flow - Verification Hardness and Possibilities
inferredcites →https://doi.org/10.1109/csfw.2004.1310735openalex-snapshot
Secure information flow by self-composition
inferredcites →https://doi.org/10.1109/csfw.2004.17openalex-snapshot
Secure information flow by self-composition
inferredcites →https://doi.org/10.1109/risp.1994.296590openalex-snapshot
A general theory of composition for trace sets closed under selective interleaving functions
inferredcites →https://doi.org/10.1109/sp.1982.10014openalex-snapshot
Security Policies and Security Models
inferredcites →https://doi.org/10.1109/sp.2009.18openalex-snapshot
Automatic Discovery and Quantification of Information Leaks
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1145/1040305.1040319openalex-snapshot
Downgrading policies and relaxed noninterference
inferredcites →https://doi.org/10.1145/1067625.806556openalex-snapshot
Information transmission in computational systems
inferredcites →https://doi.org/10.1145/1134744.1134750openalex-snapshot
Combining type-based analysis and model checking for finding counterexamples against non-interference
inferredcites →https://doi.org/10.1145/1190215.1190251openalex-snapshot
Assessing security threats of looping constructs
inferredcites →https://doi.org/10.1145/1190216.1190251openalex-snapshot
Assessing security threats of looping constructs
inferredcites →https://doi.org/10.1145/1315245.1315282openalex-snapshot
An information-theoretic model for adaptive side-channel attacks
inferredcites →https://doi.org/10.1145/1375581.1375606openalex-snapshot
Quantitative information flow as network flow capacity
inferredcites →https://doi.org/10.1145/1375696.1375713openalex-snapshot
Lagrange multipliers and maximum information leakage in different observational models
inferredcites →https://doi.org/10.1145/1554339.1554349openalex-snapshot
Measuring channel capacity to distinguish undue influence
inferredcites →https://doi.org/10.3233/jcs-1996-42-304openalex-snapshot
A sound type system for secure flow analysis
inferredcites →https://doi.org/10.3233/jcs-2007-15302openalex-snapshot
A static analysis for quantifying information flow in a simple imperative language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-17138-4_2openalex-snapshot
A Formal Analysis of Timing Channel Security via Bucketing
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_25openalex-snapshot
Information Flow Guided Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-99154-2_1openalex-snapshot
On the Additive Capacity Problem for Quantitative Information Flow
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_3openalex-snapshot
Quantitative Information Flow: From Theory to Practice?
inferred← citeshttps://doi.org/10.1007/978-3-642-15497-3_22openalex-snapshot
On Bounding Problems of Quantitative Information Flow
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_13openalex-snapshot
Maximizing Entropy over Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-38874-3_1openalex-snapshot
Automation of Quantitative Information-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_16openalex-snapshot
SAT-Based Analysis and Quantification of Information Flow in Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_1openalex-snapshot
Lattices of Information for Security: Deterministic, Demonic, Probabilistic
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_5openalex-snapshot
Abstract Channels and Their Robust Information-Leakage Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_6openalex-snapshot
Quantitative Information Flow in Boolean Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_7openalex-snapshot
When Not All Bits Are Equal: Worth-Based Information Flow
inferred← citeshttps://doi.org/10.1007/978-3-662-54455-6_13openalex-snapshot
Compositional Synthesis of Leakage Resilient Programs
inferred← citeshttps://doi.org/10.1016/j.ic.2013.03.006openalex-snapshot
Thermodynamic aspects of confidentiality
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.05.001openalex-snapshot
Maximizing entropy over Markov processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.031openalex-snapshot
Quantitative information flow as safety and liveness hyperproperties
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.022openalex-snapshot
Precise quantitative information flow analysis— a symbolic approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.034openalex-snapshot
Quantifying information leakage of randomized protocols
inferred← citeshttps://doi.org/10.1017/s0960129511000193openalex-snapshot
Secure information flow by self-composition
inferred← citeshttps://doi.org/10.1017/s0960129513000583openalex-snapshot
Preface to the special issue on quantitative information flow
inferred← citeshttps://doi.org/10.1017/s0960129513000625openalex-snapshot
Hidden-Markov program algebra with iteration
inferred← citeshttps://doi.org/10.1017/s0960129513000649openalex-snapshot
Algebraic foundations for quantitative information flow
inferred← citeshttps://doi.org/10.1109/csf.2011.21openalex-snapshot
The Complexity of Quantitative Information Flow Problems
inferred← citeshttps://doi.org/10.1109/csf.2012.18openalex-snapshot
The Thermodynamics of Confidentiality
inferred← citeshttps://doi.org/10.1109/csf.2012.26openalex-snapshot
Measuring Information Leakage Using Generalized Gain Functions
inferred← citeshttps://doi.org/10.1109/csf.2014.29openalex-snapshot
Additive and Multiplicative Notions of Leakage, and Their Capacities
inferred← citeshttps://doi.org/10.1109/csf.2019.00037openalex-snapshot
Comparing Systems: Max-Case Refinement Orders and Application to Differential Privacy
inferred← citeshttps://doi.org/10.1109/eurosp.2016.15openalex-snapshot
Precisely Measuring Quantitative Information Flow: 10K Lines of Code and Beyond
inferred← citeshttps://doi.org/10.1109/itc-asia71864.2026.11710931openalex-snapshot
Complex Data Leakage Analysis for Verilog Hardware Designs Based on Quantitative Information Flow
inferred← citeshttps://doi.org/10.1109/lics.2012.56openalex-snapshot
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
inferred← citeshttps://doi.org/10.1109/lics.2015.13openalex-snapshot
Recent Developments in Quantitative Information Flow (Invited Tutorial)
inferred← citeshttps://doi.org/10.1109/qest.2011.31openalex-snapshot
Quantifying Information Flow Using Min-Entropy
inferred← citeshttps://doi.org/10.1109/smc54092.2024.10831885openalex-snapshot
Information Security Evaluation by Information Flow Analysis Based on Stochastic Petri Nets
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3403653openalex-snapshot
Sliver: A Scalable Slicing-Based Verification for Information Flow Security
inferred← citeshttps://doi.org/10.1145/1920261.1920300openalex-snapshot
Quantifying information leaks in software
inferred← citeshttps://doi.org/10.1145/2038642.2038666openalex-snapshot
From boolean to quantitative synthesis
inferred← citeshttps://doi.org/10.1145/2166956.2166957openalex-snapshot
Calculating bounds on information leakage using two-bit patterns
inferred← citeshttps://doi.org/10.1145/3062341.3062378openalex-snapshot
Decomposition instead of self-composition for proving the absence of timing channels
inferred← citeshttps://doi.org/10.1145/3140587.3062378openalex-snapshot
Decomposition instead of self-composition for proving the absence of timing channels
inferred← citeshttps://doi.org/10.1587/transinf.2019edp7132openalex-snapshot
Quantifying Dynamic Leakage - Complexity Analysis and Model Counting-based Calculation -
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:11)2017openalex-snapshot
On the Compositionality of Quantitative Information Flow
inferred← citeshttps://doi.org/10.25148/etd.fi14040824openalex-snapshot
Foundations of Quantitative Information Flow: Channels, Cascades, and the Information Order
inferred← citeshttps://doi.org/10.25148/etd.fi14040860openalex-snapshot
Two-Bit Pattern Analysis For Quantitative Information Flow
inferred← citeshttps://doi.org/10.3233/jcs-191356openalex-snapshot
Bucketing and information flow analysis for provable timing attack mitigation
inferred← citeshttps://doi.org/10.3233/jcs-2011-0437openalex-snapshot
On bounding problems of quantitative information flow
inferred← citeshttps://doi.org/10.3390/jcp1010004openalex-snapshot
Refinement Orders for Quantitative Information Flow and Differential Privacy
inferred← citeshttps://doi.org/10.4204/eptcs.85.6openalex-snapshot
Quantitative Information Flow as Safety and Liveness Hyperproperties
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.534openalex-snapshot
The Complexity of Quantitative Information Flow in Recursive Programs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.505openalex-snapshot
Computing Information Flow Using Symbolic Model-Checking
inferred← citeshttps://doi.org/10.48550/arxiv.1007.0918openalex-snapshot
Quantifying Information Leak Vulnerabilities
inferred← citeshttps://doi.org/10.70675/975f7615z379dz499dzb639z795c66a1ceccopenalex-snapshot
From qualitative to quantitative program analysis : permissive enforcement of secure information flow
showing the first 52 of 53 · page through all 53
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.