Information hiding in probabilistic concurrent systems

DOI10.1016/J.TCS.2011.02.045zbMATH Open1216.68182OpenAlexW2020577539MaRDI QIDQ549174FDOQ549174

Authors: Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, 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

Recommendations

• Compositional methods for information-hiding
• Compositional Methods for Information-Hiding
• CONCUR 2005 – Concurrency Theory
• Weak probabilistic anonymity
• Probabilistic and nondeterministic aspects of anonymity

zbMATH Keywords

information hidinginformation flowanonymityconcurrent systems

Mathematics Subject Classification ID

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

Cites Work

• Elements of Information Theory
• Universal coalgebra: A theory of systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• CONCUR 2005 – Concurrency Theory
• Bisimulation for Demonic Schedulers
• Anonymity protocols as noisy channels
• Quantitative notions of leakage for one-try attacks
• Quantitative Information Flow, Relations and Polymorphic Types
• Assessing security threats of looping constructs
• On the Foundations of Quantitative Information Flow
• Title not available (Why is that?)
• Undecidability results for distributed probabilistic systems
• Symmetry Reduction for Probabilistic Model Checking
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• Task-structured probabilistic I/O automata
• Title not available (Why is that?)
• Quantified interference for a while language
• Safe equivalences for security properties
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Making Random Choices Invisible to the Scheduler
• Compositional Methods for Information-Hiding
• Probabilistic Anonymity Via Coalgebraic Simulations
• A formalization of anonymity and onion routing

Cited In (10)

• Probabilistic software product lines
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Compositional Methods for Information-Hiding
• On location hiding in distributed systems
• Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
• Conditional anonymity with non-probabilistic adversary
• Nearly optimal verifiable data streaming
• A Kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
• What Information Is Leaked under Concurrent Composition?
• Maximizing the conditional expected reward for reaching the goal

This page was built for publication: Information hiding in probabilistic concurrent systems

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