Quantifying Probabilistic Information Flow in Computational Reactive Systems

DOI10.1007/11555827_20zbMath1487.68052OpenAlexW2147462260MaRDI QIDQ5862670

Michael Backes

Publication date: 9 March 2022

Published in: Computer Security – ESORICS 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11555827_20

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Computer security (68M25)

Related Items (2)

Value-passing CCS with noisy channels ⋮ Computationally sound implementations of equational theories against passive adversaries

Cites Work

• A lattice model of secure information flow
• Computational Probabilistic Non-interference
• Unwinding Possibilistic Security Properties
• Theory of Cryptography
• A per model of secure information flow in sequential programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantifying Probabilistic Information Flow in Computational Reactive Systems