Information hiding in probabilistic concurrent systems

DOI10.1016/J.TCS.2011.02.045MaRDI QIDQ549174zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

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

Cited in

(10)

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

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)