|
Accession number;00A0615173
|
| Title;Complexity of Computation on ID-based Key Sharing Systems with Pairing over Elliptic Curve. |
| Author;
YAMANAKA TADAKAZU
(Kyoto Inst. of Technol., Fac. of Eng. and Des.)
OGISHI KIYOSHI
(Matsushita Electr. Ind. Co., Ltd.)
SAKAI RYUICHI
(Osaka Electro-Communication Univ., Fac. of Eng.)
KASAHARA MASAO
(Osakagakuindai Joho)
|
Journal Title;IEIC Technical Report (Institute of Electronics, Information and Communication Engineers)
|
Journal Code:S0532B
|
ISSN:0913-5685
|
|
VOL.100;NO.77(ISEC2000 10-22);PAGE.1-7(2000)
|
| Figure&Table&Reference;TBL.3, REF.10 |
| Pub. Country;Japan |
| Language;Japanese |
| Abstract;Various interesting proposals on ID-based non interactive key sharing shemes have been made so far. However most of the schemes have problems of collusion attacks. New ID-based non interactive key sharing sheme over elliptic curves was proposed by Ohgishi, Sakai and Kasahara in Nov. 1999. This new scheme realizes a higher security against the collusion attacks. In this paper, we present the algorithms of the construction of the suitable elliptic curves for the new scheme. We also estimate the complexity of computation for new scheme over the suitable elliptic curves. (author abst.) |
|
|
|
Related Articles;
|
