ACM Transactions on Computer Systems (TOCS)
A Hookup Theorem for Multilevel Security
IEEE Transactions on Software Engineering
Selected papers of the Second Workshop on Concurrency and compositionality
Authentication and authenticated key exchanges
Designs, Codes and Cryptography
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
A Model for Secure Protocols and Their Compositions
IEEE Transactions on Software Engineering
A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
A Formal Language for Cryptographic Protocol Requirements
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Using encryption for authentication in large networks of computers
Communications of the ACM
Software reliability methods
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Action Calculi, or Syntactic Action Structures
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Entity Authentication and Key Distribution
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Protocol Interactions and the Chosen Protocol Attack
Proceedings of the 5th International Workshop on Security Protocols
Some new attacks upon security protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Simple Logic for Authentication Protocol Design
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
I/O Automaton Models and Proofs for Shared-Key Communication Systems
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Protocol Independence through Disjoint Encryption
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
On the Composition of Secure Systems
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
A Compositional Logic for Protocol Correctness
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A compositional logic for proving security properties of protocols
Journal of Computer Security - Special issue on CSFW14
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Abstraction and Refinement in Protocol Derivation
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
Environmental requirements for authentication protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Security analysis of network protocols: logical and computational methods
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A modular correctness proof of IEEE 802.11i and TLS
Proceedings of the 12th ACM conference on Computer and communications security
Compositional analysis of contract-signing protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Just fast keying in the pi calculus
ACM Transactions on Information and System Security (TISSEC)
A calculus of challenges and responses
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Constructing and Reasoning About Security Protocols Using Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
On the protocol composition logic PCL
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
The layered games framework for specifications and analysis of security protocols
International Journal of Applied Cryptography
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
Journal of Automated Reasoning
An Automated Approach for Proving PCL Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Cryptographic Protocol Composition via the Authentication Tests
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Formal to Practical Security
Models and Proofs of Protocol Security: A Progress Report
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Automatic verification of correspondences for security protocols
Journal of Computer Security
An executable model for security protocol JFKr
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Semantics and logic for security protocols
Journal of Computer Security
Completeness and Counter-Example Generations of a Basic Protocol Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational semantics for basic protocol logic: a stochastic approach
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
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
Analysis of EAP-GPSK authentication protocol
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Formal proofs of cryptographic security of Diffie-Hellman-based protocols
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
The layered games framework for specifications and analysis of security protocols
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Compositional System Security with Interface-Confined Adversaries
Electronic Notes in Theoretical Computer Science (ENTCS)
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Developing security protocols by refinement
Proceedings of the 17th ACM conference on Computer and communications security
Inductive trace properties for computational security
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Probabilistic polynomial-time semantics for a protocol security logic
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Deriving secrecy in key establishment protocols
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Games and the impossibility of realizable ideal functionality
TCC'06 Proceedings of the Third conference on Theory of Cryptography
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Security goals and protocol transformations
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Inductive proofs of computational secrecy
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Sound security protocol transformations
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Sessions and separability in security protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Composition of password-based protocols
Formal Methods in System Design
Analysing TLS in the strand spaces model
Journal of Computer Security
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
Hi-index | 0.00 |
Many authentication and key exchange protocols are built using an accepted set of standard concepts such as Diffie-Hellman key exchange, nonces to avoid replay, certificates from an accepted authority, and encrypted or signed messages. We propose a general framework for deriving security protocols from simple components, using composition, refinements, and transformations. AS a case study, we examine the structure of a family of key exchange protocols that includes Station-TO-Station (STS), ISO-9798-3, Just Fast Keying (JFK), IKE and related protocols, derving all members of the family from two basic protocols, In order to associate formal proofs with protocol derivations, we extend our previous security protocol logic with preconditions, temporal assertions, composition rules, and Several other improvements. Using the logic, which we prove is sound with respect to the standard symbolic model of protocol execution and attack (the "Dolev-Yao model"), the security properties of the standard signature based Challange- Response protocol and the Diffie-Hellman key exchange protocol are estabilished. The ISO-9798-3 protocol is then proved correct by composing the correctness proofs of these two simple protocols Although our current formal logic is not sufficient to modulary prove security for all of our current protocol derivations. the derivation system provides a framework for further improvements.