CONCUR 2005 – Concurrency Theory
DOI10.1007/11539452zbMATH Open1134.68426OpenAlexW1737342522MaRDI QIDQ5897482FDOQ5897482
Authors: Mohit Bhargava, Catuscia Palamidessi 
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11539452
Recommendations
Formal languages and automata (68Q45) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (29)
- Title not available (Why is that?)
- Anonymity Protocols as Noisy Channels
- Epistemic Strategies and Games on Concurrent Processes
- Making random choices invisible to the scheduler
- Compositional Methods for Information-Hiding
- Traces, Executions and Schedulers, Coalgebraically
- Probabilistic and nondeterministic aspects of anonymity
- Information hiding in probabilistic concurrent systems
- Probabilistic Anonymity Via Coalgebraic Simulations
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
- A quantitative doxastic logic for probabilistic processes and applications to information-hiding
- Conditional anonymity with non-probabilistic adversary
- Anonymity protocols as noisy channels
- Anonymity and individual risk
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
- Maximizing entropy over Markov processes
- Bisimulation for Demonic Schedulers
- To know or not to know: Epistemic approaches to security protocol verification
- Algorithmic probabilistic game semantics. Playing games with automata
- A Framework for Automatically Checking Anonymity with μCRL
- Opacity for linear constraint Markov chains
- Behavioural equivalences of a probabilistic pi-calculus
- Weak probabilistic anonymity
- Analyzing anonymity attacks through noisy channels
- Quantifying leakage in the presence of unreliable sources of information
- Probable innocence revisited
- Probabilistic anonymity via coalgebraic simulations
- Formalizing provable anonymity in Isabelle/HOL
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
This page was built for publication: CONCUR 2005 – Concurrency Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897482)
