Information hiding in probabilistic concurrent systems

DOI10.1016/j.tcs.2011.02.045zbMath1216.68182MaRDI QIDQ549174

Catuscia Palamidessi, Peter van Rossum, Miguel E. Andrés, Ana Sokolova

Publication date: 7 July 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.045

zbMATH Keywords

concurrent systems; anonymity; information hiding; information flow

Mathematics Subject Classification ID

94A60: Cryptography

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Conditional anonymity with non-probabilistic adversary, Probabilistic may/must testing: retaining probabilities by restricted schedulers, Probabilistic software product lines, Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms, Nearly Optimal Verifiable Data Streaming, Maximizing the Conditional Expected Reward for Reaching the Goal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Universal coalgebra: A theory of systems
• Task-structured probabilistic I/O automata
• Anonymity protocols as noisy channels
• Quantitative Notions of Leakage for One-try Attacks
• Quantitative Information Flow, Relations and Polymorphic Types
• Safe Equivalences for Security Properties
• Assessing security threats of looping constructs
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• Making Random Choices Invisible to the Scheduler
• On the Foundations of Quantitative Information Flow
• Bisimulation for Demonic Schedulers
• Undecidability Results for Distributed Probabilistic Systems
• Compositional Methods for Information-Hiding
• Elements of Information Theory
• Probabilistic Anonymity Via Coalgebraic Simulations
• Symmetry Reduction for Probabilistic Model Checking
• A Formalization of Anonymity and Onion Routing
• CONCUR 2005 – Concurrency Theory