학술지IEEE Transactions on Industrial Informatics (1551-3203), 20(4), 6834 ~ 6843
등재유형SCIE
게재일자 20240401
In this work, we show that Wang et al.’s scheme is broken by key recovery attacks: anyone can recover the entire private keys of any users. We then propose a new secure CLS scheme and prove its unforgeability against type I and type II adversaries under the hardness assumption of the Elliptic Curve Diffie-Hellman problem.
