Presentation 1998/7/30
Unforgeability Problem for a Class of Protocols Using Signatures
Maki YOSHIDA, Toru FUJIWARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider the unforgeability of the cryptographic protocols using the signatures. A signature is said to be forgeable if a user can get more signatures thatn the signer gives him. In this paper, for a given cryptographic protocol using signatures, the decision problem to decide whether or not all signatures can be issued are unforgeable is discussed. In signature schemes, the one-way hash functions are often used to compress a signing message. Taking account of the usage of one-way hash functions in the protocol, we present a sufficient condition under which the problem is decidable.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Cryptographic Protocol / Security / Unforgeability / Digital signature
Paper # ISEC98-15
Date of Issue

Conference Information
Committee ISEC
Conference Date 1998/7/30(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Unforgeability Problem for a Class of Protocols Using Signatures
Sub Title (in English)
Keyword(1) Cryptographic Protocol
Keyword(2) Security
Keyword(3) Unforgeability
Keyword(4) Digital signature
1st Author's Name Maki YOSHIDA
1st Author's Affiliation Department of Informatics and Mathematical Science Graduate School of Engineering Science Osaka University()
2nd Author's Name Toru FUJIWARA
2nd Author's Affiliation Department of Informatics and Mathematical Science Graduate School of Engineering Science Osaka University
Date 1998/7/30
Paper # ISEC98-15
Volume (vol) vol.98
Number (no) 227
Page pp.pp.-
#Pages 8
Date of Issue