Paradigm shifts in protocol analysis
Proceedings of the 1999 workshop on New security paradigms
The faithfulness of abstract protocol analysis: message authentication
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Analysis of security protocols as open systems
Theoretical Computer Science
Security Goals: Packet Trajectories and Strand Spaces
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Non Interference for the Analysis of Cryptographic Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Mechanical Proofs about a Non-repudiation Protocol
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Formal Specification and Verification of Mobile Agent Data Integrity Properties: A Case Study
MA '01 Proceedings of the 5th International Conference on Mobile Agents
Suitability of a Classical Analysis Method for E-commerce Protocols
ISC '01 Proceedings of the 4th International Conference on Information Security
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
First-order verification of cryptographic protocols
Journal of Computer Security - CSFW13
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
New semantic model for authentication protocols in ASMs
Journal of Computer Science and Technology
Specification and formal verification of security requirements
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
The faithfulness of abstract protocol analysis: message authentication
Journal of Computer Security - Special issue on ACM conference on computer and communications security, 2001
Modelling the relative strength of security protocols
Proceedings of the 2nd ACM workshop on Quality of protection
Understanding the intruder through attacks on cryptographic protocols
Proceedings of the 44th annual Southeast regional conference
Temporal Logics of Knowledge and their Applications in Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal security analysis of Australian e-passport implementation
AISC '08 Proceedings of the sixth Australasian conference on Information security - Volume 81
Verifying Multi-party Authentication Using Rank Functions and PVS
Formal Aspects in Security and Trust
New paradigm of inference control with trusted computing
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Secure transaction protocol analysis: models and applications
Secure transaction protocol analysis: models and applications
Justifying a dolev-yao model under active attacks
Foundations of Security Analysis and Design III
Generic verification of security protocols
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
A formal approach for reasoning about a class of diffie-hellman protocols
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Efficient construction of machine-checked symbolic protocol security proofs
Journal of Computer Security
| Hi-index | 0.00 |
This paper presents a general approach for analysis and verification of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by an examination of the Needham-Schroeder public-key protocol. The contribution of this paper is to develop a specific theory appropriate to the analysis of authentication protocols, built on top of the general CSP semantic framework. This approach aims to combine the ability to express such protocols in a natural and precise way with the facility to reason formally about the properties they exhibit.