Presentation 1996/7/22
Computationally Secure ID-NIKS
Atsunori FUJIKAWA, Yasuyuki MURAKAMI, Masao KASAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is a very important problem, from both theoretical and practical point of view, to realize a secure and simple ID-based non-interactive key sharing scheme (ID~NIKS). First, in this paper, we show some necessary conditions for realizing a secure NIKS. Then, we propose a new NIKS that is computationally secure, and show that this scheme satisfies the secure conditions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) ID / NIKS / factoring problem / discrete logarithm problem / RSA public-key cryptosystem
Paper # ISEC96-19
Date of Issue

Conference Information
Committee ISEC
Conference Date 1996/7/22(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Computationally Secure ID-NIKS
Sub Title (in English)
Keyword(1) ID
Keyword(2) NIKS
Keyword(3) factoring problem
Keyword(4) discrete logarithm problem
Keyword(5) RSA public-key cryptosystem
1st Author's Name Atsunori FUJIKAWA
1st Author's Affiliation Department of Information Science and Design, Kyoto Institute of Technology()
2nd Author's Name Yasuyuki MURAKAMI
2nd Author's Affiliation Communication Equipment Division, MURATA MACHINERY, LTD.
3rd Author's Name Masao KASAHARA
3rd Author's Affiliation Department of Information Science and Design, Kyoto Institute of Technology
Date 1996/7/22
Paper # ISEC96-19
Volume (vol) vol.96
Number (no) 167
Page pp.pp.-
#Pages 6
Date of Issue