Quantitative information flow for scheduler-dependent systems

DOI10.4204/EPTCS.194.4MaRDI QIDQ7031240zbMATH OpenFDO

Authors Yusuke Kawamoto, Thomas Given-Wilson

Publication date 6 February 2025

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4204/EPTCS.194.4

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer security (68M25)

Cites work

• Abstract channels and their robust information-leakage ordering
• Analyzing security protocols using time-bounded task-PIOAs
• Anonymity protocols as noisy channels
• Asymptotic information leakage under one-try attacks
• Information hiding in probabilistic concurrent systems
• Making Random Choices Invisible to the Scheduler
• Min-entropy as a resource
• Model Checking Interactive Markov Chains
• On the Foundations of Quantitative Information Flow
• Quantifying information leakage in process calculi
• Quantifying information leakage of randomized protocols
• Quantitative analysis of the leakage of confidential data
• Quantitative notions of leakage for one-try attacks
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems

Cited in

(1)

• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: Quantitative information flow for scheduler-dependent systems

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