Assessing security threats of looping constructs
From MaRDI portal
Publication:3189801
DOI10.1145/1190216.1190251zbMath1295.68089OpenAlexW4238789074MaRDI QIDQ3189801
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
Semantics in the theory of computing (68Q55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Quantifying leakage in the presence of unreliable sources of information ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Min-entropy as a resource ⋮ Hybrid statistical estimation of mutual information and its application to information flow ⋮ Upper bound computation of information leakages for unbounded recursion ⋮ An axiomatization of information flow measures ⋮ On the Additive Capacity Problem for Quantitative Information Flow ⋮ Maximizing entropy over Markov processes ⋮ Quantitative information flow as safety and liveness hyperproperties ⋮ Quantifying Vulnerability of Secret Generation Using Hyper-Distributions ⋮ Compositional Synthesis of Leakage Resilient Programs ⋮ Information Theory and Security: Quantitative Information Flow ⋮ Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) ⋮ Information hiding in probabilistic concurrent systems ⋮ Evaluation of anonymity and confidentiality protocols using theorem proving ⋮ On the Foundations of Quantitative Information Flow ⋮ Quantitative Notions of Leakage for One-try Attacks ⋮ Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption ⋮ Formalization of Entropy Measures in HOL ⋮ Quantitative Information Flow and Applications to Differential Privacy ⋮ Quantifying information leakage in process calculi ⋮ Sampling automata and programs
