Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5308469
DOI10.1007/b95995zbMath1126.68510OpenAlexW3105029025MaRDI QIDQ5308469
Ajith Ramanathan, John C. Mitchell, Vanessa Teague, Andrej Scedrov
Publication date: 28 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95995
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (7)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Automated verification of selected equivalences for security protocols ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Weakening the perfect encryption assumption in Dolev-Yao adversaries ⋮ Analyzing security protocols using time-bounded task-PIOAs ⋮ On the relationships between notions of simulation-based security ⋮ Protocol Composition Logic (PCL)
Uses Software
This page was built for publication: Foundations of Software Science and Computation Structures
