Formal Verification of Cryptographic Protocols in Spi-Calculus(<Special Topics> Formal Approach to Information Security)

DOI Web Site 15 References

Bibliographic Information

Other Title
  • spi計算における暗号プロトコルの形式的検証(<特集>数理的技法による情報セキュリティ)
  • spi計算における暗号プロトコルの形式的検証
  • spi ケイサン ニ オケル アンゴウ プロトコル ノ ケイシキテキ ケンショウ

Search this article

Abstract

This survey presents Abadi and Gordon's spi-calculus, which is a "process calculus" (i.e., a formal language of concurrent computation) for the verification of "cryptographic protocols" (i.e., procedures for secure communication in computer networks). First, we present process calculi before the spi-calculus (CCS and the pi-calculus), introducing the notion of reaction relation and structural congruence. We then define the spi-calculus and show an example of cryptographic ptotocols, represented as a class of spi-calculus processes. After discussing the formalization of security properties (secrecy and authenticity) and multiple sessions, we conclude by referring to generalizations of the spi-calculus (Abadi and Fournet's applied pi-calculus, and a recent result by Bruno Blanchet).

Journal

References(15)*help

See more

Details 詳細情報について

Report a problem

Back to top