Date of Original Version

6-2005

Type

Conference Proceeding

Abstract or Description

Authentication and secrecy properties are proved by very different methods: the former by local reasoning, leading to matching knowledge of all principals about the order of their actions, the latter by global reasoning towards the impossibility of knowledge of some data. Hence, proofs conceptually decompose in two parts, each encapsulating the other as an assumption. From this observation, we develop a simple logic of authentication that encapsulates secrecy requirements as assumptions. We apply it within the derivational framework to derive a large class of key distribution protocols based on the authentication properties of their components.

DOI

10.1109/CSFW.2005.7

Comments

This paper appears in: Computer Security Foundations, 2005. CSFW-18 2005. 18th IEEE Workshop Publication Date: 20-22 June 2005 On page(s): 48- 61

Share

COinS