| Presentation | 1995/5/12 Provably Secure IDNIKS Hatsukazu Tanaka, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper a new identity-based non-interactive key sharing scheme (IDNIKS) for mail-type cipher communication has been proposed. The center algorithm is very simple and easily implemented. The security depends on the difficulty of factoring and discrete logarithm problem and seems to be equivalent to the well-known RSA public-key cryptosystem. The proposed IDNIKS can be certified to be secure against the considerable attacks involving user's collusion. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | ID / non-interactive key sharing / discrete logarithm problem / difficulty of factoring |
| Paper # | |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1995/5/12(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) | Provably Secure IDNIKS |
| Sub Title (in English) | |
| Keyword(1) | ID |
| Keyword(2) | non-interactive key sharing |
| Keyword(3) | discrete logarithm problem |
| Keyword(4) | difficulty of factoring |
| 1st Author's Name | Hatsukazu Tanaka |
| 1st Author's Affiliation | Department of Electrical and Electronics Engineering Faculty of Engineering, Kobe University() |
| Date | 1995/5/12 |
| Paper # | |
| Volume (vol) | vol.95 |
| Number (no) | 27 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |