An Extended Logic for Analyzing Timed-Release Public-Key Protocols

A logic is presented for analyzing public key protocols which provide time-dependent confidentiality using a trusted party. The logic is developed as an extension to an existing cryptographic modal logic with time due to Coffey and Saidha. The extension is designed to help capture aspects of timed-release public key protocols that are not captured in the Coffey-Saidha logic. The explicit use of time in the logic is shown to facilitate reasoning about the correctness of an example protocol.

[1]  ProtocolsLi GongSRI InternationalComputer.  Fail-Stop Protocols : An Approach to Designing Secure , 1994 .

[2]  Volker Kessler,et al.  Formal Semantics for Authentication Logics , 1996, ESORICS.

[3]  Li Gong,et al.  Reasoning about belief in cryptographic protocols , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[4]  Pierre Bieber,et al.  A logic of communication in hostile environment , 1990, [1990] Proceedings. The Computer Security Foundations Workshop III.

[5]  T. Coffey,et al.  Logic for verifying public-key cryptographic protocols , 1997 .

[6]  Mark R. Tuttle,et al.  A Semantics for a Logic of Authentication , 1991, PODC 1991.

[7]  Paul F. Syverson,et al.  On unifying some cryptographic protocol logics , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.

[8]  Rebecca N. Wright,et al.  An authentication logic supporting synchronization, revocation, and recency , 1996, CCS '96.

[9]  Paul F. Syverson.  Adding time to a logic of authentication , 1993, CCS '93.

[10]  Martín Abadi,et al.  A semantics for a logic of authentication (extended abstract) , 1991, PODC '91.

[11]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[12]  Colin Boyd,et al.  Towards formal analysis of security protocols , 1993, [1993] Proceedings Computer Security Foundations Workshop VI.

[13]  Ronald L. Rivest,et al.  Time-lock Puzzles and Timed-release Crypto , 1996 .