security protocols, systems security, SSML When applying information security, we need to go beyond the analysis of individual security protocols and consider how they are used within distributed systems, software applications and services. Important as they are, security protocols only form a part of the overall security engineering design for a particular distributed system. The effective use of any security protocol will typically depend upon certain structural data such as key information being available for use by some- and at the same time made unavailable to others. Systems need to be designed with requirements like these in mind.
|
947
|
A Logic for Authentication
– Burrows, Abadi, et al.
- 1990
|
|
703
|
On the security of public key protocols
– Dolev, Yao
- 1983
|
|
697
|
Using encryption for authentication in large networks of computers
– Needham, Schroeder
- 1978
|
|
607
|
A Calculus for Cryptographic Protocols: The Spi Calculus
– Abadi, Gordon
- 1999
|
|
458
|
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
– Lowe
- 1996
|
|
352
|
A paractical public-key cryptosystem provably secure against adaptive chosen ciphertext attack
– Cramer, Shoup
- 1998
|
|
329
|
The inductive approach to verifying cryptographic protocols
– Paulson
- 1998
|
|
323
|
Entity Authentication and Key Distribution
– Bellare, Rogaway
- 1995
|
|
306
|
Isabelle/HOL — A Proof Assistant for Higher-Order Logic
– Nipkow, Paulson, et al.
- 2002
|
|
305
|
Principles of Program Analysis
– Nielson, Nielson, et al.
- 1999
|
|
246
|
Language-based information-flow security
– Sabelfeld, Myers
- 2003
|
|
225
|
Secrecy by typing in security protocols
– Abadi
- 1997
|
|
198
|
Reconciling two views of cryptography (The computational soundness of formal encryption
– Abadi, Rogaway
- 2000
|
|
159
|
An attack on the needham-schroeder public key authentication protocol
– Lowe
- 1995
|
|
132
|
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels", Eurocrypt 01. Available at http://eprint.iacr.org/2001/040
– Canetti, Krawczyk
|
|
106
|
Undecidability of bounded security protocols
– Durgin, Lincoln, et al.
- 1999
|
|
105
|
A model for asynchronous reactive systems and its application to secure message transmission
– Pfitzmann, Waidner
- 2001
|
|
99
|
Protocol insecurity with finite number of sessions is NPcomplete
– Rusinowitch, Turuani
- 2001
|
|
76
|
Inductive analysis of the Internet protocol TLS
– Paulson
- 1999
|
|
71
|
Programming satan’s computer
– Anderson, Needham
- 1995
|
|
67
|
Modelling and Analysis of Security Protocols
– Ryan, Schnieder
- 2001
|
|
65
|
Security Engineering
– Anderson
- 2001
|
|
62
|
CSP and determinism in security modelling
– Roscoe
|
|
61
|
Process Algebra and Non-interference
– Ryan, Schneider
- 1999
|
|
60
|
Practical Cryptography
– Ferguson, Schneier
- 2003
|
|
59
|
Strand spaces: Proving security protocols correct
– Fabrega, Hertzog, et al.
- 1999
|
|
52
|
What do we mean by entity authentication
– Gollmann
- 1996
|
|
51
|
Types and Effects for Asymmetric Cryptographic Protocols
– Gordon, Jeffrey
- 2002
|
|
48
|
Quantifying Information Flow
– Lowe
- 2002
|
|
45
|
Capsl integrated protocol environment
– Denker, Millen
- 2000
|
|
44
|
Relating strands and multiset rewriting for security protocol analysis
– Cervesato, Durgin, et al.
- 2000
|
|
39
|
What is intransitive noninterference
– Roscoe, Goldsmith
- 1999
|
|
36
|
Capsl intermediate language
– Denker, Millen
- 1999
|
|
35
|
Is it possible to decide whether a cryptographic protocol is secure or not
– Comon, Shmatikov
- 2002
|
|
23
|
Validating a web service security abstraction by typing
– Gordon, Pucella
- 2003
|
|
22
|
Security properties: Two agents are sufficient
– Comon-Lundh, Cortier
|
|
22
|
Security Goals: Packet Trajectories and Strand Spaces
– Guttman
- 2001
|
|
21
|
A specification language for crypto-protocol based on multiset rewriting, dependent types and subsorting
– Cervesato
- 2001
|
|
21
|
Authentication tests and the structure of bundles
– Guttman, Thayer
|
|
19
|
Proving secrecy is easy enough
– Cortier, Millen, et al.
- 2001
|
|
19
|
Information flow for algol-like languages
– Clark, Hunt
- 2002
|
|
18
|
Static analysis for secrecy and non-interference in networks of processes
– Bodei, Dagano, et al.
- 2001
|
|
17
|
The logic of authentication protocols
– Syverson, Cervesato
- 2001
|
|
15
|
Verifying authentication protocols: Methodology and example
– Woo, Lam
- 1993
|
|
15
|
Notes on Nominal Calculi for Security and Mobility
– Gordon
- 1997
|
|
13
|
A Non-Functional Approach to System Integrity
– Foley
- 2003
|
|
12
|
The cocaine auction protocol: On the power of anonymous broadcast
– Stajano, Anderson
- 1999
|
|
10
|
Cryptographic security of reactive systems (extended abstract
– Pfitzmann, Schunter, et al.
- 2000
|
|
9
|
Mathematical Models of Computer Security
– Ryan
- 2000
|
|
8
|
Distributed Systems Analysis with CCS
– Bruns
- 1997
|
