Quantifying information leakage in process calculi

DOI10.1016/j.ic.2008.12.007zbMath1167.68038OpenAlexW1982065519MaRDI QIDQ1023286

Michele Boreale

Publication date: 11 June 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.12.007

zbMATH Keywords

information theoryprocess calculiinformation leakagesecrecy

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (6)

Automation of Quantitative Information-Flow Analysis ⋮ Searching secrets rationally ⋮ Value-passing CCS with noisy channels ⋮ A semiring-based trace semantics for processes with applications to information leakage analysis ⋮ Asymptotic information leakage under one-try attacks ⋮ Quantifying opacity

Cites Work

• A Mathematical Theory of Communication
• Symbolic bisimulations
• A calculus for cryptographic protocols: The spi calculus
• Testing equivalences for processes
• Basic concepts, identities and inequalities -- the toolkit of information theory
• Testing equivalence for mobile processes
• A symbolic semantics for the \(\pi\)-calculus
• Anonymity protocols as noisy channels
• Quantitative Information Flow, Relations and Polymorphic Types
• Assessing security threats of looping constructs
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Quantifying Information Leakage in Process Calculi
• Anonymity Protocols as Noisy Channels
• Verifying secrets and relative secrecy
• Compositional Methods for Information-Hiding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantifying information leakage in process calculi