Quantifying information leakage of randomized protocols

DOI10.1016/j.tcs.2015.07.034zbMath1328.68142OpenAlexW1736896304MaRDI QIDQ2517235

Axel Legay, Fabrizio Biondi, Pasquale Malacaria, Andrzej Wąsowski

Publication date: 17 August 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.034

zbMATH Keywords

Markov chainMarkov decision processmodel checkinginformation leakagechannel capacityquantitative information flowprobabilistic system

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Hybrid statistical estimation of mutual information and its application to information flow ⋮ An automated quantitative information flow analysis for concurrent programs

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Maximizing entropy over Markov processes
• Quantitative information flow as safety and liveness hyperproperties
• Anonymity protocols as noisy channels
• Quantifying Information Leakage of Randomized Protocols
• On the complexity of computing maximum entropy for Markovian Models
• Probability and Information
• Compositional Closure for Bayes Risk in Probabilistic Noninterference
• On the Foundations of Quantitative Information Flow
• Maximizing Entropy over Markov Processes
• The Optimum Leakage Principle for Analyzing Multi-threaded Programs
• Elements of Information Theory
• Abstract Channels and Their Robust Information-Leakage Ordering
• Entropy and semivaluations on semilattices
• Hidden-Markov program algebra with iteration

This page was built for publication: Quantifying information leakage of randomized protocols