Timed calculus of cryptographic communication

Authors:
Johannes Borgström;Olga Grinchtein;Simon Kramer
Affiliations:
EECS, Technical University of Berlin;IT, Uppsala University;Ecole Polytechnique Fédérale de Lausanne
Venue:
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Year:
2006

Citing 7
Cited 0

A security risk of depending on synchronized clocks

ACM SIGOPS Operating Systems Review
Reasoning about knowledge

Reasoning about knowledge
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Concurrent and Real Time Systems: The CSP Approach

Concurrent and Real Time Systems: The CSP Approach
Analysing Time Dependent Security Properties in CSP Using PVS

ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
A simple framework for real-time cryptographic protocol analysis with compositional proof rules

Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Timed spi-calculus with types for secrecy and authenticity

CONCUR 2005 - Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the (core) Calculus of Cryptographic Communication (C3) with real time, e.g., time stamps and timed keys. We illustrate how to use this extended calculus (tC3) on a specification and verification case study, namely the failure of the Wide-Mouthed-Frog protocol in its original, i.e., timed, version.