The following pages link to CSP and anonymity (Q5096415):
Displaying 20 items.
- Comparative analysis of related notions of opacity in centralized and coordinated architectures (Q373013) (← links)
- On compositional reasoning about anonymity and privacy in epistemic logic (Q504214) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Theorem-proving anonymity of infinite-state systems (Q845891) (← links)
- Probable innocence revisited (Q860902) (← links)
- Probabilistic anonymity via coalgebraic simulations (Q974115) (← links)
- Conditional anonymity with non-probabilistic adversary (Q1750044) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol (Q2225593) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Formalizing provable anonymity in Isabelle/HOL (Q2355379) (← links)
- Quantifying leakage in the presence of unreliable sources of information (Q2361344) (← links)
- Anonymity protocols as noisy channels (Q2482451) (← links)
- Weak Probabilistic Anonymity (Q2864392) (← links)
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap (Q3498468) (← links)
- A Framework for Automatically Checking Anonymity with μCRL (Q3608464) (← links)
- A Formalization of Anonymity and Onion Routing (Q5862309) (← links)
- Active opacity of discrete-event systems (Q6134222) (← links)
