On the Foundations of Quantitative Information Flow

From MaRDI portal
Revision as of 04:24, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3617736

DOI10.1007/978-3-642-00596-1_21zbMath1234.68101OpenAlexW2097151854MaRDI QIDQ3617736

No author found.

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_21




Related Items (44)

Quantifying leakage in the presence of unreliable sources of informationAlgebra for Quantitative Information FlowProbabilistic and nondeterministic aspects of anonymityAutomation of Quantitative Information-Flow AnalysisComplexity and resource bound analysis of imperative programs using difference constraintsMin-entropy as a resourceThermodynamic aspects of confidentialityHybrid statistical estimation of mutual information and its application to information flowSecurity of Numerical Sensors in AutomataUpper bound computation of information leakages for unbounded recursionAn axiomatization of information flow measuresAn automated quantitative information flow analysis for concurrent programsOn the Additive Capacity Problem for Quantitative Information FlowProgram algebra for quantitative information flowSearching secrets rationallyUtility/privacy trade-off as regularized optimal transportCompositional methods for information-hidingMaximizing entropy over Markov processesPrecise quantitative information flow analysis -- a symbolic approachQuantitative information flow as safety and liveness hyperpropertiesQuantifying Vulnerability of Secret Generation Using Hyper-DistributionsSecure Multi-party Computation: Information Flow of Outputs and Game TheorySecurity Analysis of Cache Replacement PoliciesCompositional Synthesis of Leakage Resilient ProgramsCombining Differential Privacy and Mutual Information for Analyzing Leakages in WorkflowsAnalyzing anonymity attacks through noisy channelsOn the Relation between Differential Privacy and Quantitative Information FlowConditional anonymity with non-probabilistic adversaryUnnamed ItemInformation Theory and Security: Quantitative Information FlowGeneralized Differential Privacy: Regions of Priors That Admit Robust Optimal MechanismsPreface to the special issue on quantitative information flowAsymptotic information leakage under one-try attacksAn analysis of trust in anonymity networks in the presence of adaptive attackersInformation hiding in probabilistic concurrent systemsAn algebraic approach for reasoning about information flowAttainable unconditional security for shared-key cryptosystemsEvaluation of anonymity and confidentiality protocols using theorem provingQuantitative Notions of Leakage for One-try AttacksWorst- and average-case privacy breaches in randomization mechanismsQuantifying information leakage of randomized protocolsQuantitative Information Flow and Applications to Differential PrivacyOn Privacy and Accuracy in Data Releases (Invited Paper)Sampling automata and programs



Cites Work




This page was built for publication: On the Foundations of Quantitative Information Flow