Assessing security threats of looping constructs

DOI10.1145/1190216.1190251MaRDI QIDQ3189801zbMATH OpenOpenAlexWikidataFDO

Authors Pasquale Malacaria

Publication date 12 September 2014

Published in Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1190216.1190251

zbMATH Keywords

information theorylanguage semanticssecurity

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) Semantics in the theory of computing (68Q55)

Recommendations

• Information theory and security: Quantitative information flow
• A semantic approach to secure information flow
• The complexity of quantitative information flow in recursive programs
• Recent developments in quantitative information flow (invited tutorial)
• Quantifying information leakage in process calculi

Cited in

(26)

• Risk assessment for one-counter threads
• Quantifying information leakage in process calculi
• Sampling automata and programs
• Quantifying leakage in the presence of unreliable sources of information
• Hybrid statistical estimation of mutual information and its application to information flow
• An axiomatization of information flow measures
• Quantitative information flow as safety and liveness hyperproperties
• Quantitative notions of leakage for one-try attacks
• Quantified interference for a while language
• From operational models to information theory; side channels in pGCL with Isabelle
• Formalization of entropy measures in HOL
• Quantitative information flow and applications to differential privacy
• Quantifying Vulnerability of Secret Generation Using Hyper-Distributions
• Compositional Synthesis of Leakage Resilient Programs
• Information theory and security: Quantitative information flow
• On the Foundations of Quantitative Information Flow
• Min-entropy as a resource
• Maximizing entropy over Markov processes
• Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
• Information hiding in probabilistic concurrent systems
• Formal verification of differential privacy for interactive systems (extended abstract)
• Evaluation of anonymity and confidentiality protocols using theorem proving
• Upper bound computation of information leakages for unbounded recursion
• On the Additive Capacity Problem for Quantitative Information Flow
• An interval-based abstraction for quantifying information flow
• Probabilistic and nondeterministic aspects of anonymity

This page was built for publication: Assessing security threats of looping constructs

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