Kazukuni Kobara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kazukuni Kobara has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
Hideki Imai
Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST)
43 shared publications- SeongHan SHIN
National Institute of Advanced Industrial Science and Technology (AIST)
32 shared publications - Hideki Imai
The University of Tokyo
6 shared publications Yang Cui
6 shared publicationsH. Imai
5 shared publicationsSeongHan Shin
5 shared publications
Latest Publications
- Open Access
- 1 March 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E107.A (3) , 331-343
Power Analysis of Floating-Point Operations for Leakage Resistance Evaluation of Neural Network Model Parameters
In the field of machine learning security, as one of the attack surfaces especially for edge devices, the application of side-channel analysis such as correlation power/electromagnetic analysis (CPA/CEMA) is expanding. Aiming to evaluate the leakage resistance of neural network (NN) model parameters, i.e. weights and biases, we conducted a feasibility study of CPA/CEMA on floating-point (FP) operations, which are the basic operations of NNs. This paper proposes approaches to recover weights and biases using CPA/CEMA on multiplication and addition operations, respectively. It is essential to take into account the characteristics of the IEEE 754 representation in order to realize the recovery with high precision and efficiency. We show that CPA/CEMA on FP operations requires different approaches than traditional CPA/CEMA on cryptographic implementations such as the AES.
- 1 March 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E107.A (3) , 331-343
Open AccessPower Analysis of Floating-Point Operations for Leakage Resistance Evaluation of Neural Network Model Parameters
In the field of machine learning security, as one of the attack surfaces especially for edge devices, the application of side-channel analysis such as correlation power/electromagnetic analysis (CPA/CEMA) is expanding. Aiming to evaluate the leakage resistance of neural network (NN) model parameters, i.e. weights and biases, we conducted a feasibility study of CPA/CEMA on floating-point (FP) operations, which are the basic operations of NNs. This paper proposes approaches to recover weights and biases using CPA/CEMA on multiplication and addition operations, respectively. It is essential to take into account the characteristics of the IEEE 754 representation in order to realize the recovery with high precision and efficiency. We show that CPA/CEMA on FP operations requires different approaches than traditional CPA/CEMA on cryptographic implementations such as the AES.
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E99.D (4) , 787-795
Cyber Physical Security for Industrial Control Systems and IoT
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E99.D (4) , 787-795
Cyber Physical Security for Industrial Control Systems and IoT
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 352-355
Key Establishment Using Physically Unclonable Functions
As an alternative to tamper-resistant modules, PUFs (Physically Unclonable Functions) [1], [6], [7], [8], [9], [10], [11], [14], [15], [18], [25], [26] have received much attention due to their unclonable physical characteristics. In this paper, we propose key establishment (KE1 and KE2) protocols using PUFs which can mitigate side-channel attacks and satisfy two security requirements (i.e., Freshness and Non-Regeneration). Also, we discuss security of the KE1 and KE2 protocols, and compare with the previous PUF-based key exchange protocols [3], [4], [27].
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 352-355
Key Establishment Using Physically Unclonable Functions
As an alternative to tamper-resistant modules, PUFs (Physically Unclonable Functions) [1], [6], [7], [8], [9], [10], [11], [14], [15], [18], [25], [26] have received much attention due to their unclonable physical characteristics. In this paper, we propose key establishment (KE1 and KE2) protocols using PUFs which can mitigate side-channel attacks and satisfy two security requirements (i.e., Freshness and Non-Regeneration). Also, we discuss security of the KE1 and KE2 protocols, and compare with the previous PUF-based key exchange protocols [3], [4], [27].
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E98.A (6) , 1320-1324
On Unlinkability of Password-Based Anonymous Authentication
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E98.A (6) , 1320-1324
On Unlinkability of Password-Based Anonymous Authentication
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E98.A (12) , 2456-2470
On Finding Secure Domain Parameters Resistant to Cheon's Algorithm
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E98.A (12) , 2456-2470
On Finding Secure Domain Parameters Resistant to Cheon's Algorithm
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E98.A (1) , 428-433
Hidden Credential Retrieval, Revisited
- 1 January 2015
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E98.A (1) , 428-433
Hidden Credential Retrieval, Revisited
- 1 January 2014
- Published by The Editorial Committee of Synthesiology in Synthesiology
- Vol. 7 (3) , 179-189
Secure password authentication schemes and their applications
- 1 January 2014
- Published by The Editorial Committee of Synthesiology in Synthesiology
- Vol. 7 (3) , 179-189
Secure password authentication schemes and their applications
- 1 January 2014
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE ESS Fundamentals Review
- Vol. 7 (3) , 166-171
Voluntary Posting on Open Web Sites
- 1 January 2014
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE ESS Fundamentals Review
- Vol. 7 (3) , 166-171
Voluntary Posting on Open Web Sites
- 1 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-111
RSA-based Password-Authenticated Key Retrieval using multiple servers
A PAKR (Password-Authenticated Key Retrieval) protocol and its multi-server system allow one party (say, client), who has a rememberable password, to retrieve a long-term static key in an exchange of messages with at least one other party (say, server) that has a private key. In this paper, we propose an RSA-based PAKR (for short, RSA-PAKR) protocol using multiple n servers, and then show that the RSA-PAKR protocol provides security of passwords and static keys against an attacker who takes full control of n - 1 servers. Several aspects of the RSA-PAKR protocol and its extension (including efficiency improvements, implementation issue and extension for distinguishing on-line dictionary attacks) are followed.
- 1 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-111
RSA-based Password-Authenticated Key Retrieval using multiple servers
A PAKR (Password-Authenticated Key Retrieval) protocol and its multi-server system allow one party (say, client), who has a rememberable password, to retrieve a long-term static key in an exchange of messages with at least one other party (say, server) that has a private key. In this paper, we propose an RSA-based PAKR (for short, RSA-PAKR) protocol using multiple n servers, and then show that the RSA-PAKR protocol provides security of passwords and static keys against an attacker who takes full control of n - 1 servers. Several aspects of the RSA-PAKR protocol and its extension (including efficiency improvements, implementation issue and extension for distinguishing on-line dictionary attacks) are followed.