In this paper, we show a collusion attack on the novel and sophisticated ID-based non-interactive key sharing scheme proposed by Tanaka [2], [3]. It is based on a linear algebraic approach [4]. We discuss its complexity and provide numerical simulation results of the success probability in forging the shared keys.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kiyomichi ARAKI, Masato NAKAO, "Attacking Method on Tanaka's Scheme**" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 3, pp. 247-248, March 1996, doi: .
Abstract: In this paper, we show a collusion attack on the novel and sophisticated ID-based non-interactive key sharing scheme proposed by Tanaka [2], [3]. It is based on a linear algebraic approach [4]. We discuss its complexity and provide numerical simulation results of the success probability in forging the shared keys.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_3_247/_p
Copy
@ARTICLE{e79-d_3_247,
author={Kiyomichi ARAKI, Masato NAKAO, },
journal={IEICE TRANSACTIONS on Information},
title={Attacking Method on Tanaka's Scheme**},
year={1996},
volume={E79-D},
number={3},
pages={247-248},
abstract={In this paper, we show a collusion attack on the novel and sophisticated ID-based non-interactive key sharing scheme proposed by Tanaka [2], [3]. It is based on a linear algebraic approach [4]. We discuss its complexity and provide numerical simulation results of the success probability in forging the shared keys.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Attacking Method on Tanaka's Scheme**
T2 - IEICE TRANSACTIONS on Information
SP - 247
EP - 248
AU - Kiyomichi ARAKI
AU - Masato NAKAO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1996
AB - In this paper, we show a collusion attack on the novel and sophisticated ID-based non-interactive key sharing scheme proposed by Tanaka [2], [3]. It is based on a linear algebraic approach [4]. We discuss its complexity and provide numerical simulation results of the success probability in forging the shared keys.
ER -