Presentation 1997/12/19
A sufficient condition for unforgeability problem for the receipt of any message to be decidable
Maki Yoshida, Toru Fujiwara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider unforgeability problem of a receipt for the cryptographic protocols in which a user can get a receipt of her/his message under the following conditions: (1) the number of the meaningless operations is infinite; (2) the set of data which the purpose of the enemy is to forge one of data in is infinite; and (3) if the goal data set is infinite set, then meaningless operations are independent of each datum in the goal set. We formalize the problem, give a sufficient condition under which the problem is decidable, and present an algorithm to solve it.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Cryptographic Protocol / Security / Unforgeability
Paper # ISEC97-57
Date of Issue

Conference Information
Committee ISEC
Conference Date 1997/12/19(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) A sufficient condition for unforgeability problem for the receipt of any message to be decidable
Sub Title (in English)
Keyword(1) Cryptographic Protocol
Keyword(2) Security
Keyword(3) Unforgeability
1st Author's Name Maki Yoshida
1st Author's Affiliation Graduate School of Engineering Science Osaka University()
2nd Author's Name Toru Fujiwara
2nd Author's Affiliation Graduate School of Engineering Science Osaka University
Date 1997/12/19
Paper # ISEC97-57
Volume (vol) vol.97
Number (no) 461
Page pp.pp.-
#Pages 12
Date of Issue