Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Network Security Under Siege: The Timing Attack
Computer - Special issue: neural computing: companion issue to Spring 1996 IEEE Computational Science & Engineering
Proceedings of the 7th ACM conference on Computer and communications security
Limitations of the Kerberos authentication system
ACM SIGCOMM Computer Communication Review
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Kerberos Version 4: Inductive Analysis of the Secrecy Goals
ESORICS '98 Proceedings of the 5th European Symposium on Research in Computer Security
Analysing Time Dependent Security Properties in CSP Using PVS
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Casper: A Compiler for the Analysis of Security Protocols
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A simple language for real-time cryptographic protocol analysis
ESOP'03 Proceedings of the 12th European conference on Programming
Timed verification of the reliable adaptive multicast protocol
Journal of Systems and Software
Rule-based static analysis of network protocol implementations
Information and Computation
Modelling and Checking Timed Authentication of Security Protocols
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Verifying Security Protocols Modelled by Networks of Automata
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Modeling and Verifying Time Sensitive Security Protocols with Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed analysis of security protocols
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
Model Checking and Artificial Intelligence
Constraint Abstraction in Verification of Security Protocols
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Timed Automata Based Model Checking of Timed Security Protocols
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Is your security protocol on time?
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Constraints solution for time sensitive security protocols
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Efficient detection of Zeno runs in timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Timed Automata Based Model Checking of Timed Security Protocols
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Modelling and Checking Timed Authentication of Security Protocols
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Verifying Security Protocols Modelled by Networks of Automata
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |
We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol. Timing information allows us to study of different attack scenarios. We illustrate the attacks by model checking the protocol using Uppaal. We also present new challenges and threats that arise when considering time.