A Probabilistic Applied Pi–Calculus
From MaRDI portal
Publication:3498438
DOI10.1007/978-3-540-76637-7_12zbMath1137.68448OpenAlexW1604195593MaRDI QIDQ3498438
Catuscia Palamidessi, Angelo Troina, Jean Goubault-Larrecq
Publication date: 15 May 2008
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76637-7_12
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (7)
Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ A pure labeled transition semantics for the applied pi calculus ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Strand spaces with choice via a process algebra semantics ⋮ Probabilistic Analysis of Binary Sessions ⋮ Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding knowledge in security protocols under equational theories
- A calculus for cryptographic protocols: The spi calculus
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- On the security of public key protocols
- Initial Algebra Semantics and Continuous Algebras
- A method for obtaining digital signatures and public-key cryptosystems
- Mobile values, new names, and secure communication
- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
This page was built for publication: A Probabilistic Applied Pi–Calculus