CSP and anonymity
From MaRDI portal
Publication:5096415
Recommendations
Cites work
Cited in
(21)- Probabilistic anonymity via coalgebraic simulations
- Quantifying leakage in the presence of unreliable sources of information
- Theorem-proving anonymity of infinite-state systems
- Algorithmic probabilistic game semantics. Playing games with automata
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
- Comparing the notions of opacity for discrete-event systems
- Probable innocence revisited
- Formalizing and Analyzing Security Ceremonies with Heterogeneous Devices in ANP and PDL
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- A formalization of anonymity and onion routing
- Anonymity protocols as noisy channels
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
- Weak probabilistic anonymity
- A Framework for Automatically Checking Anonymity with μCRL
- Probabilistic and nondeterministic aspects of anonymity
- Formalizing provable anonymity in Isabelle/HOL
- On compositional reasoning about anonymity and privacy in epistemic logic
- Active opacity of discrete-event systems
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- Conditional anonymity with non-probabilistic adversary
- Modular verification of protocol equivalence in the presence of randomness
This page was built for publication: CSP and anonymity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096415)