Trace Equivalence and Epistemic Logic to Express Security Properties
From MaRDI portal
Publication:5041278
DOI10.1007/978-3-030-50086-3_7OpenAlexW3037027989MaRDI QIDQ5041278
Publication date: 13 October 2022
Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.03719
Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Deciding equivalence-based properties using constraint solving
- On compositional reasoning about anonymity and privacy in epistemic logic
- Deciding knowledge in security protocols under equational theories
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- A calculus for cryptographic protocols: The spi calculus
- Task-structured probabilistic I/O automata
- Combining Epistemic Logic and Hennessy-Milner Logic
- Spatial and Epistemic Modalities in Constraint-Based Process Calculi
- Role Interchange for Anonymity and Privacy of Voting
- Safe Equivalences for Security Properties
- The Applied Pi Calculus
- A Probabilistic Applied Pi–Calculus
- Making Random Choices Invisible to the Scheduler
- Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
- On the security of public key protocols
- Probabilistic Bisimulation for Realistic Schedulers
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
This page was built for publication: Trace Equivalence and Epistemic Logic to Express Security Properties
