Compositional methods for information-hiding

DOI10.1017/S0960129514000292zbMath1362.68205MaRDI QIDQ2971070

Catuscia Palamidessi, Konstantinos Chatzikokolakis, Christelle Braun

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Maximizing the Conditional Expected Reward for Reaching the Goal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Making random choices invisible to the scheduler
• Anonymity protocols as noisy channels
• Asymptotic Information Leakage under One-Try Attacks
• Computing the Leakage of Information-Hiding Systems
• Information Flow in Interactive Systems
• Compositional Closure for Bayes Risk in Probabilistic Noninterference
• On the Foundations of Quantitative Information Flow
• Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

This page was built for publication: Compositional methods for information-hiding