Communicating sequential processes
Communicating sequential processes
Authentication and authenticated key exchanges
Designs, Codes and Cryptography
A calculus of mobile processes, I
Information and Computation
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
A Formal Language for Cryptographic Protocol Requirements
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Using encryption for authentication in large networks of computers
Communications of the ACM
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
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
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Intensional specifications of security protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
What do we mean by entity authentication?
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Authentication primitives and their compilation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying security protocols as planning in logic programming
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Primitives for authentication in process algebras
Theoretical Computer Science
A comparison of three authentication properties
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Message Authentication through Non Interference
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Transforming Processes to Check and Ensure Information Flow Security
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Classification of Security Properties (Part I: Information Flow)
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
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Formal Verification of the Horn-Preneel Micropayment Protocol
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Security Protocols and Specifications
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A Uniform Approach for the Definition of Security Properties
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Lazy Infinite-State Analysis of Security Protocols
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
Verifying authentication protocol implementations
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Authentication via Localized Names
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Strand Spaces and Rank Functions: More than Distant Cousins
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Types and Effects for Asymmetric Cryptographic Protocols
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
How to prevent type flaw attacks on security protocols
Journal of Computer Security - CSFW13
Proving Secrecy is Easy Enough
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Authenticity by Typing for Security Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Automatic testing equivalence verification of spi calculus specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
An Approach for Modeling and Analysis of Security System Architectures
IEEE Transactions on Knowledge and Data Engineering
Study on strand space model theory
Journal of Computer Science and Technology
Authenticity by typing for security protocols
Journal of Computer Security - Special issue on CSFW14
Specifying Kerberos 5 cross-realm authentication
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Relating multiset rewriting and process algebras for security protocol analysis
Journal of Computer Security - Special issue on WITS'03
A decision procedure for the existence of a rank function
Journal of Computer Security
A method for symbolic analysis of security protocols
Theoretical Computer Science
Authentication primitives for secure protocol specifications
Future Generation Computer Systems - Special issue: Parallel computing technologies
Visual security protocol modeling
NSPW '05 Proceedings of the 2005 workshop on New security paradigms
Information and Computation
Improving the security of industrial networks by means of formal verification
Computer Standards & Interfaces
Theoretical Computer Science - Automated reasoning for security protocol analysis
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Secrecy by interpretation functions
Knowledge-Based Systems
Types and effects for asymmetric cryptographic protocols
Journal of Computer Security - Special issue on CSFW15
Embedding agents within the intruder to detect parallel attacks
Journal of Computer Security - Special issue on CSFW15
Perfect cryptography, S5 knowledge, and algorithmic knowledge
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Rewriting Techniques in the Constraint Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Tools for cryptographic protocols analysis: A technical and experimental comparison
Computer Standards & Interfaces
Authentication primitives for secure protocol specifications
Future Generation Computer Systems - Special issue: Parallel computing technologies
Looking at a class of RFID APs through GNY logic
International Journal of Security and Networks
A proof system for information flow security
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Typing one-to-one and one-to-many correspondences in security protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A theorem-proving approach to verification of fair non-repudiation protocols
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Secrecy analysis in protocol composition logic
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A formal approach to designing secure software architectures
HASE'04 Proceedings of the Eighth IEEE international conference on High assurance systems engineering
Towards a symbolic bisimulation for the spi calculus
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Specifying authentication using signal events in CSP
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
SeVe: automatic tool for verification of security protocols
Frontiers of Computer Science in China
A formal security analysis of an OSA/Parlay authentication interface
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Automatic detection of attacks on cryptographic protocols: a case study
DIMVA'05 Proceedings of the Second international conference on Detection of Intrusions and Malware, and Vulnerability Assessment
Verifying security protocols: an application of CSP
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Analysing a biometric authentication protocol for 3g mobile systems using CSP and rank functions
SPC'06 Proceedings of the Third international conference on Security in Pervasive Computing
Verification of security protocols using LOTOS-method and application
Computer Communications
A new hierarchical and scalable group key exchange protocol with XOR operation
International Journal of Wireless and Mobile Computing
| Hi-index | 0.01 |
This paper presents a general approach for analysis and verification of authentication properties using the theory of Communicating Sequential Processes (CSP). The paper aims 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 ability to reason formally about the properties they exhibit. The theory is illustrated by an examination of the Needham-Schroeder Public-Key protocol. The protocol is first examined with respect to a single run and then more generally with respect to multiple concurrent runs.