Computational Semantics for Basic Protocol Logic - A Stochastic Approach

Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first order logic As opposed to earlier treatments, we introduce a new, fully probabilistic method to assign computational semantics to the syntax. The idea is to make use of the usual mathematical treatment of stochastic processes, hence be able to treat arbitrary probability distributions, non-negligible probability of collision, causal dependence or independence, and so on. We present this via considering a simple example of such a formal model, the Basic Protocol Logic by K. Hasebe and M. Okada [20], but we think the technique is suitable for a wide range of formal methods for protocol correctness proofs. We first review our framework of proof-system, BPL, for proving correctness of authentication protocols, and provide computational semantics. Then we give a full proof of the soundness theorem. We also comment o...

• Type: Conference
• Year: 2007
• Where: ASIAN
• Authors: Gergei Bana, Koji Hasebe, Mitsuhiro Okada
• Keywords: Algorithms, ASIAN 2007, Computational Semantics, Formal Methods, first Order Logic