A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time

A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time

Masaya Maeda

生駒 : 奈良先端科学技術大学院大学, 1998.3

Thesis / Diss.

Volume No.

No. Printing year Location Call Number Material ID Circulation class Status Waiting

1

R000678

2

  • [IS]1998(13)

Restricted

Details

Publication year

1998

Series title

奈良先端科学技術大学院大学情報科学研究科修士論文 ; 1998年3月

Note

学位記番号: 修第811号

授与年月日: 1998/03/24

学位の種類: 修士(工学)

学生番号: 9651204

Country of publication

Japan

Title language

English (eng)

Language of texts

English (eng)

Author information

前田, 昌也 (マエダ, マサヤ)

Subject

cryptography

protocol

security

formal verification

term rewriting system