CONCUR 2003 - Concurrency Theory
From MaRDI portal
Publication:5900575
DOI10.1007/b11938zbMath1274.94097MaRDI QIDQ5900575
No author found.
Publication date: 30 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11938
cryptographic protocols; composition theorem; probabilistic process calculus; computational security
94A60: Cryptography
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, A computational interpretation of Dolev-Yao adversaries, Analyzing security protocols using time-bounded task-PIOAs, Task-structured probabilistic I/O automata, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, A Process Algebra for Reasoning About Quantum Security