Computational semantics for basic protocol logic a stochastic approach

Gergei Bana, Koji Hasebe, Mitsuhiro Okada

研究成果: Conference article査読

抄録

This paper relates formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first order logic. Instead of the way Datta et al. defined computational semantics to their Protocol Composition Logic, we introduce a new, fully probabilistic method to assign computational semantics to the syntax. We present this via considering a simple example of such a formal model, the Basic Protocol Logic by K. Hasebe and M. Okada [7] , but the technique is suitable for extensions to more complex situations such as PCL. We make use of the usual mathematical treatment of stochastic processes, hence are able to treat arbitrary probability distributions, non-negligible probability of collision, causal dependence or independence.

本文言語English
ページ(範囲)86-94
ページ数9
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4846 LNCS
DOI
出版ステータスPublished - 2007
イベント12th Asian Computing Science Conference, ASIAN 2007 - Doha, Qatar
継続期間: 2007 12 92007 12 11

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Computational semantics for basic protocol logic a stochastic approach」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル