| Presentation | 1999/7/23 Optimal Construction of ID-Based Key Sharing Scheme for Large-Scale Networks Gochiro HANAOKA, Tsuyoshi NISHIOKA, Hideki IMAI, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Efficient ID-based key sharing schemes are desired world-widely for secure communications on the Internet and other networks. Although they have a lot of advauntages in terms of efficiency, to achieve high security a largeamount of memory is required. While conventional schemes establishe communication links betweenn auny pair of entities in a communication system, in many practical communication systems such as broadcastiuag, not all linksare required. In this article, we show the optiumal method to remove these unnecessary communication links. In our scheme, the required memory for each entity is just proportional to the number of its partners, while that in conventional schemes is proportional to the number of entities in the whole system. E.g., if an entity communicates only with 1/r of others, the required memory is reduced to be 1/r of that of conventional KPS. Furthermore, this memory size is proven to be optimal. Our scheme provides a more efficient way for secure communication especially in large-scale networks. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | ID-based cryptosystem / KPS / Asymmetric key sharing / collusion threshold / memory size |
| Paper # | ISEC99-31 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1999/7/23(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) | Optimal Construction of ID-Based Key Sharing Scheme for Large-Scale Networks |
| Sub Title (in English) | |
| Keyword(1) | ID-based cryptosystem |
| Keyword(2) | KPS |
| Keyword(3) | Asymmetric key sharing |
| Keyword(4) | collusion threshold |
| Keyword(5) | memory size |
| 1st Author's Name | Gochiro HANAOKA |
| 1st Author's Affiliation | Institute of Industrial Scieunce, University of Tokyo() |
| 2nd Author's Name | Tsuyoshi NISHIOKA |
| 2nd Author's Affiliation | Institute of Industrial Scieunce, University of Tokyo |
| 3rd Author's Name | Hideki IMAI |
| 3rd Author's Affiliation | Institute of Industrial Scieunce, University of Tokyo |
| Date | 1999/7/23 |
| Paper # | ISEC99-31 |
| Volume (vol) | vol.99 |
| Number (no) | 209 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |