An automated quantitative information flow analysis for concurrent programs

DOI10.1007/978-3-031-16336-4_3zbMath1522.68135MaRDI QIDQ6103027

Sepehr Amir-Mohammadian, Khayyam Salehi, Ali A. Noroozi, Mohammadsadegh Mohagheghi

Publication date: 2 June 2023

Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)

zbMATH Keywords

confidentialityinformation leakageprotocol securityquantitative information flowMarkovian processes

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing entropy over Markov processes
• Backward and forward bisimulation minimization of tree automata
• CCS expressions, finite state processes, and three problems of equivalence
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Precise quantitative information flow analysis -- a symbolic approach
• Quantifying information leakage of randomized protocols
• Computing Information Flow Using Symbolic Model-Checking
• Quantitative Information Flow and Applications to Differential Privacy
• Secure information flow by self-composition
• On the Foundations of Quantitative Information Flow
• Three logics for branching bisimulation
• The Optimum Leakage Principle for Analyzing Multi-threaded Programs
• Forward and Backward Bisimulations for Chemical Reaction Networks
• KeY: A Formal Method for Object-Oriented Systems

This page was built for publication: An automated quantitative information flow analysis for concurrent programs