Presentation | 2003/7/10 Rabin Tree and its Application to Broadcast Encryption Hiroaki KIKUCHI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | This paper presents a key management scheme based on Rabin public-key cryptosystem, which minimizes a number of secret key at recipient. A probability that a given random root key would succeed to have a full Rabin tree with 2n-i nodes is proved to be exponential to the number of users n. An application to broadcast encryption which allows excluding faulty recipients is proposed. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Content protection / Rabin public-key algorithm |
Paper # | ISEC2003-13 |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 2003/7/10(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) | Rabin Tree and its Application to Broadcast Encryption |
Sub Title (in English) | |
Keyword(1) | Content protection |
Keyword(2) | Rabin public-key algorithm |
1st Author's Name | Hiroaki KIKUCHI |
1st Author's Affiliation | School of Electronics and Infromation Technology, Tokai University() |
Date | 2003/7/10 |
Paper # | ISEC2003-13 |
Volume (vol) | vol.103 |
Number (no) | 195 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |