Logical relations for encryption

Eijiro Sumii, Benjamin C. Pierce

研究成果: Article査読

24 被引用数 (Scopus)

抄録

The theory of relational parametricity and its logical relations proof technique are powerful tools for reasoning about information hiding in the polymorphic λ-calculus. We investigate the application of these tools in the security domain by defining a cryptographic λ-calculus - an extension of the standard simply typed λ-calculus with primitives for encryption, decryption, and key generation - and introducing syntactic logical relations (in the style of Pitts and Birkedal-Harper) for this calculus that can be used to prove behavioral equivalences between programs that use encryption. We illustrate the framework by encoding some simple security protocols, including the Needham-Schroeder public-key protocol. We give a natural account of the well-known attack on the original protocol and a straightforward proof that the improved variant of the protocol is secure.

本文言語English
ページ(範囲)521-554
ページ数34
ジャーナルJournal of Computer Security
11
4
DOI
出版ステータスPublished - 2003
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • 安全性、リスク、信頼性、品質管理
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Logical relations for encryption」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル