Communicating sequential processes
Communicating sequential processes
Verification of network security protocols
Computers and Security
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
An approach to the formal verification of cryptographic protocols
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Authentication in Open Systems
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
Some new attacks upon security protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Finite-state analysis of SSL 3.0
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Assessment of E-Commerce security using AHP and evidential reasoning
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The primary objective of this paper is to present the definition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It allows the specification of classical security properties (authentication, secrecy and integrity) and also electronic commerce properties (non-repudiation, anonymity, good atomicity, money atomicity, certified delivery, etc.). The logic constructs are interpreted over a trace-based model. Traces reflect valid protocol executions in the presence of a malicious smart intruder. The logic is endowed with a tableau-based proof system that leads to a modular denotational semantics.