A Sufficient Condition for the Reply Forgeability Problem to be Decidable and a Decision Algorithm

8 References
  • YOSHIDA Maki
    Graduate School of Engineering Science, Osaka University
  • FUJIWARA Toru
    Graduate School of Engineering Science, Osaka University
  • WATANABE Hajime
    Graduate School of Information Science, Nara Institute of Science and Technology

Bibliographic Information

Other Title
  • 返信偽造可能性判定問題が決定可能となるための十分条件と判定法

Search this article

Description

We discuss the decision problem of cryptographic protocols which decide whether the reply for a message is forgeable or not in a given cryptographic protocol. A simple sufficient condition was shown under which the problem is decidable. In this paper, we show a new sufficient condition which relaxes the subcondition about the operations which opponents can execute. A polynomial-time algorithm is also shown for the problem which satisfies the condition.

Journal

  • Technical report of IEICE. ISEC

    Technical report of IEICE. ISEC 96 (295), 39-49, 1996-10-14

    The Institute of Electronics, Information and Communication Engineers

References(8)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1570291227409998848
  • NII Article ID
    110003296924
  • NII Book ID
    AN10060811
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top