The complexity of synchronous notions of information flow security

DOI10.1016/j.tcs.2016.03.011zbMath1339.68111arXiv1402.0601OpenAlexW1764928511WikidataQ115036527 ScholiaQ115036527MaRDI QIDQ278742

Franck Cassez, Chenyi Zhang, Ron van der Meyden

Publication date: 2 May 2016

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

Full work available at URL: https://arxiv.org/abs/1402.0601

zbMATH Keywords

computational complexitysecurityinformation flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Probabilistic opacity for Markov decision processes
• A comparison of semantic models for noninterference
• The complexity of two-player games of incomplete information
• A theory of timed automata
• Verifying persistent security properties
• Information flow in systems with schedulers. I: Definitions
• Controlling information release in the \(\pi\)-calculus
• The Complexity of Quantitative Information Flow in Recursive Programs
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• The Complexity of Synchronous Notions of Information Flow Security
• Synthesis of Non-Interferent Timed Systems
• Provably Difficult Combinatorial Games
• Transforming out timing leaks
• Control and synthesis of non-interferent timed systems
• Unwinding Possibilistic Security Properties
• Timing-Sensitive Information Flow Analysis for Synchronous Systems