An Application of Hash Functions to a Message Authentication Protocol
-
- NAKAHARA Osamu
- Department of Computer Science, Tokyo Institute of Technology
-
- WATANABE Osamu
- Department of Mathematical and Computer Sciences, Tokyo Institute of Technology
Bibliographic Information
- Other Title
-
- ハッシュ関数の認証プロトコルへの応用
Search this article
Description
Fiat and Shamir proposed a message authentication protocol (or, noninteractive identification protocol) and showed that it is secure assuming that the hash function used in the protocol is a random function. However, any fixed hash function is not a random function at all. In this paper, we propose a more reasonable condition for a hash function and show a message authentication protocol, which is similar to the one by Fiat and Shamir, that is secure provided that the hash function used in the protocol satisfies the proposed condition. We also discuss relationships between this new condition and the other properties of hash functions.
Journal
-
- IEICE technical report. Theoretical foundations of Computing
-
IEICE technical report. Theoretical foundations of Computing 97 (628), 55-62, 1998-03-24
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1570854177376756096
-
- NII Article ID
- 110003191366
-
- NII Book ID
- AN10013152
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
