ACM Transactions on Computer Systems (TOCS)
A calculus of mobile processes, I
Information and Computation
Testing equivalence for mobile processes
Information and Computation
Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
Non-interleaving semantics for mobile processes
Theoretical Computer Science
Secrecy by typing in security protocols
Journal of the ACM (JACM)
Names fo the &pgr;-calculus agents handled locally
Theoretical Computer Science - Special issues on models and paradigms for concurrency
A compiler for analyzing cryptographic protocols using noninterference
ACM Transactions on Software Engineering and Methodology (TOSEM)
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Primitives for authentication in process algebras
Theoretical Computer Science
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Authentication via Localized Names
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Hi-index | 0.02 |
We use two authentication primitives proposed recently as a linguistic support for enforcing authentication. They offer a way of abstracting from various specifications of authentication and of obtaining idealized protocols "secure by construction". Consequently, they help in proving that a cryptographic protocol correctly implements its corresponding abstract version; when the implementation is incorrect, suggestions on how to fix it may come from reasoning on the abstract specification.