A Framework for Automatically Checking Anonymity with μCRL
From MaRDI portal
Publication:3608464
DOI10.1007/978-3-540-75336-0_19zbMath1211.94027OpenAlexW2155570147MaRDI QIDQ3608464
Jun Pang, Mohammad Torabi Dashti, Tom Chothia, Simona Orzan
Publication date: 5 March 2009
Published in: Trustworthy Global Computing (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/a-framework-for-automatically-checking-anonymity-with--crl(db543cae-acaf-4654-9356-0f0fee7bb59e).html
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ A Framework for Automatically Checking Anonymity with μCRL ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ Keeping Secrets in Resource Aware Components ⋮ Formalizing provable anonymity in Isabelle/HOL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebra of communicating processes with abstraction
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Weak Probabilistic Anonymity
- mcmas: A Model Checker for Multi-agent Systems
- A Framework for Automatically Checking Anonymity with μCRL
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
- A practical secret voting scheme for large scale elections
- CSP and anonymity
- Programming Languages and Systems
- A Formalization of Anonymity and Onion Routing
- CONCUR 2005 – Concurrency Theory
This page was built for publication: A Framework for Automatically Checking Anonymity with μCRL
