Quantifying probabilistic information flow in computational reactive systems

DOI10.1007/11555827_20MaRDI QIDQ5862670zbMATH OpenOpenAlexFDO

Authors 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) Computer security (68M25) Cryptography (94A60)

Recommendations

• Computational probabilistic non-interference
• Quantifying information flow in cryptographic systems
• Quantitative Information Flow, Relations and Polymorphic Types
• Information theory and security: Quantitative information flow
• scientific article; zbMATH DE number 1863164

Cites work

• A lattice model of secure information flow
• A per model of secure information flow in sequential programs
• Computational probabilistic non-interference
• scientific article; zbMATH DE number 1692933 (Why is no real title available?)
• scientific article; zbMATH DE number 1692935 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 3915608 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 588035 (Why is no real title available?)
• scientific article; zbMATH DE number 1948404 (Why is no real title available?)
• scientific article; zbMATH DE number 1487487 (Why is no real title available?)
• Theory of Cryptography
• Unwinding Possibilistic Security Properties

Cited in

(7)

• Computationally sound implementations of equational theories against passive adversaries
• Decidability of Parameterized Probabilistic Information Flow
• Value-passing CCS with noisy channels
• Computational probabilistic non-interference
• Quantifying information flow in cryptographic systems
• Possibilistic information flow control in the presence of encrypted communication
• An interval-based abstraction for quantifying information flow

This page was built for publication: Quantifying probabilistic information flow in computational reactive systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862670)