Updated on 2024/12/19

写真a

 
KUWAKADO,Hidenori
 
Organization
Faculty of Informatics Professor
Title
Professor
External link

Degree

  • 博士（工学） ( 1999.9 )

Research Interests

  • 暗号理論 情報セキュリティ

  • Cryptography Information Security

Research Areas

  • Manufacturing Technology (Mechanical Engineering, Electrical and Electronic Engineering, Chemical Engineering) / Communication and network engineering

Professional Memberships

  • Information Processing Society of Japan

    　 More details

  • The Institute of Electronics ,Information and Communication Engineers

    　 More details

  • The Institute of Electrical and Electronics Engineers, Inc.

    　 More details

Papers

  • Secret Sharing Schemes Using Modulo-2^{m} Arithmetic Operations Reviewed

    桑門秀典

    2018.12

    　More details

    Cloud services using secret sharing schemes have been launched recently. Since secret sharing schemes have been usually achieved over a finite field, the throughput for sharing and reconstructing a secret depends on the implementation of finite field operations. However, almost all the CPUs do not support finite-field operations as primary instructions. We study k-outof-n secret sharing schemes using the linear transform over Z_{2^m}. The advantage of the linear transform over Z_{2^m} is that almost all the CPUs support a modulo-2^m addition, a modulo-2^m subtraction, and a modulo-2^m multiplication as primary instructions. We show the conditions of an encoding matrix to achieve the k-out-of-n secret sharing scheme based on the linear transform over Z_{2^m}. The conditions suggest that the k-out-of-n secret sharing scheme over Z_{2^m} is non-ideal. We also show the maximum size of a secret if the Vandermonde matrix whose all the elements are a power of two is used as the encoding matrix.

    DOI： 10.1109/DESEC.2018.8625126

    researchmap

  • Parallelizable Message Preprocessing for Merkle-Damgard Hash Functions Reviewed

    桑門秀典, 廣瀬勝一, 満保雅浩

    2018 International Symposium on Information Theory and Its Applications   pp.457-461   2018.10

    　More details

    Since well-known hash functions sequentially process a message, the time for computing a digest strongly depends on the performance of a single processor. Even if multi-core processors are available, it is difficult to reduce the time. This paper focuses on designing a message preprocessing that can fully utilize multi-core processors. Since our message preprocessing can be efficiently computed by massively parallel processing, it contributes to reduce the time for computing a digest. The experiments using graphics processing units show that our message preprocessing improves the throughput for computing a digest.

    researchmap

  • A Pseudorandom-Function Mode Based on Lesamnta-LW and the MDP Domain Extension and Its Applications

    廣瀬勝一, 桑門秀典, 吉田博隆

    IEICE Transactions on Fundamentals   vol. E101-A, no. 1   2018.1

    　More details

  • Secure Regenerating Codes Using Linear Regenerating Codes and the All-or-Nothing Transform

    Hidenori Kuwakado, Masazumi Kurihara

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E100D ( 3 )   483 - 495   2017.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    This paper proposes secure regenerating codes that are composed of non-secure regenerating codes and a new all-or-nothing transform. Unlike the previous analysis of secure regenerating codes, the security of the proposed codes is analyzed in the sense of the indistinguishability. The advantage of the proposed codes is that the overhead caused by the security against eavesdropping is much less than that of previous secure regenerating codes. The security of the proposed codes against eavesdropping mainly depends on the new all-or-nothing transform.

    DOI： 10.1587/transinf.2016EDP7220

    Web of Science

    researchmap

  • A Collision Attack on a Double-Block-Length Compression Function Instantiated with Round-Reduced AES-256

    Chen Jiageng, Hirose Shoichi, Kuwakado Hidenori, Miyaji Atsuko

    Lecture Notes in Computer Science   8949   271 - 285   2015.3

    　More details

    Language：English   Publisher：Springer  

    DOI： 10.1007/978-3-319-15943-0_17

    researchmap

▼display all

Books

  • オープンネットワークと暗号技術 (4) Reviewed

    桑門秀典（ Role： Sole author）

    鉄道と電気技術  2016.7 

    　More details

  • オープンネットワークと暗号技術 (3) Reviewed

    桑門秀典（ Role： Sole author）

    鉄道と電気技術  2016.6 

    　More details

  • 暗号のマルチメディアセキュリティへの応用（ネットワーク上の認証システム／電子メールのセキュリティ ほか）

    桑門秀典（ Role： Contributor）

    田中初一『マルチメディアセキュリティ』昭晃堂  1998.10 

    　More details

MISC

  • Indifferentiability of single-block-length and rate-1 compression functions

    Hidenori Kuwakado, Masakatu Morii

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E90A ( 10 )   2301 - 2308   2007.10

    　More details

    Language：English   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The security notion of indifferentiability was proposed by Maurer, Renner, and Holenstein in 2004. In 2005, Coron, Dodis, Malinaud, and Puniya discussed the indifferentiability of hash functions. They have shown that the Merkle-Damgard construction is not secure in the sense of indifferentiability. In this paper, we analyze the security of single-block-length and rate-1 compression functions in the sense of indifferentiability. We formally show that all single-block-length and rate-1 compression functions, which include the Davies-Meyer compression function, are insecure. Furthermore, we show how to construct a secure single-block-length and rate-1 compression function in the sense of indifferentiability. This does not contradict our result above.

    DOI： 10.1093/ietfec/e90-a.10.2301

    Web of Science

    researchmap

  • Indifferentiability of single-block-length and rate-1 compression functions

    Hidenori Kuwakado, Masakatu Morii

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E90A ( 10 )   2301 - 2308   2007.10

    　More details

    Language：English   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The security notion of indifferentiability was proposed by Maurer, Renner, and Holenstein in 2004. In 2005, Coron, Dodis, Malinaud, and Puniya discussed the indifferentiability of hash functions. They have shown that the Merkle-Damgard construction is not secure in the sense of indifferentiability. In this paper, we analyze the security of single-block-length and rate-1 compression functions in the sense of indifferentiability. We formally show that all single-block-length and rate-1 compression functions, which include the Davies-Meyer compression function, are insecure. Furthermore, we show how to construct a secure single-block-length and rate-1 compression function in the sense of indifferentiability. This does not contradict our result above.

    DOI： 10.1093/ietfec/e90-a.10.2301

    Web of Science

    researchmap

  • RC4に対するweak keyを利用した秘密鍵探索手法

    2007

    　More details

  • Conditions for Achieving a Revocable Network Coding Scheme

    2007

    　More details

  • Indifferentiable Double-Block-Length Compression Function

    2007

    　More details

▼display all

Presentations

  • White-Box Symmetric Cipher Using Quantum Memory

    Hidenori Kuwakado, Shoichi Hirose, Masahiro Mambo

    2020.1 

    　More details

    Event date： 2020.1

    researchmap

  • Authenticated Encryption Based on Lesamnta-LW Hashing Mode

    Shoichi Hirose, Hidenori Kuwakado, Hirotaka Yoshida

    2019.12 

    　More details

    Event date： 2019.12

    researchmap

  • Secret Sharing Schemes Using Modulo-2^{m} Arithmetic Operations

    KUWAKADO,Hidenori

    The 2018 IEEE Conference on Dependable and Secure Computing  2018.12 

    　More details

    Event date： 2018.12

    Cloud services using secret sharing schemes have been launched recently. Since secret sharing schemes have been usually achieved over a finite field, the throughput for sharing and reconstructing a secret depends on the implementation of finite field operations. However, almost all the CPUs do not support finite-field operations as primary instructions. We study k-outof-n secret sharing schemes using the linear transform over Z_{2^m}. The advantage of the linear transform over Z_{2^m} is that almost all the CPUs support a modulo-2^m addition, a modulo-2^m subtraction, and a modulo-2^m multiplication as primary instructions. We show the conditions of an encoding matrix to achieve the k-out-of-n secret sharing scheme based on the linear transform over Z_{2^m}. The conditions suggest that the k-out-of-n secret sharing scheme over Z_{2^m} is non-ideal. We also show the maximum size of a secret if the Vandermonde matrix whose all the elements are a power of two is used as the encoding matrix.

    researchmap

  • Parallelizable Message Preprocessing for Merkle-Damgard Hash Functions

    KUWAKADO,Hidenori, HIROSE,Shoichi, MAMBO,Masahiro

    2018 International Symposium on Information Theory and Its Applications  2018.10 

    　More details

    Event date： 2018.10

    Since well-known hash functions sequentially process a message, the time for computing a digest strongly depends on the performance of a single processor. Even if multi-core processors are available, it is difficult to reduce the time. This paper focuses on designing a message preprocessing that can fully utilize multi-core processors. Since our message preprocessing can be efficiently computed by massively parallel processing, it contributes to reduce the time for computing a digest. The experiments using graphics processing units show that our message preprocessing improves the throughput for computing a digest.

    researchmap

  • Artificial Metrics of Electric Devices and Their Applications

    KUWAKADO,Hidenori, HORII, Yasushi, KOBAYASHI, Takashi, KAMBARA, Tomoya

    Faculty of Informatics, Kansai University  2017.7 

    　More details

    Event date： 2017.7

    An Identification of artificial objects is lately receiving much attention for two reasons: the problem of counterfeiting of artificial objects, such as goods that use brand names, in international trade and the necessity of achieving a secure communication in the Internet of Things (IoT), which is a network of artificial objects that are embedded with network connectivity. To identify artificial objects, “fingerprints” of artificial objects, introduced during manufacturing and non-separable characteristics from artificial objects themselves, have to be discovered. This article reports fingerprints for acceleration sensors, flash memory, non-Foster matching circuits and elemental techniques for identifying fingerprints or measuring fingerprints with stability. This article demonstrates an encoding method for recording fingerprints securely in a distributed storage system.

    researchmap

▼display all

Awards

  • 活動功労賞

    2011.4   電子情報通信学会関西支部長  

    　More details

    Country：Japan

    researchmap

  • 編集活動感謝状

    2006.11   電子情報通信学会基礎・境界ソサイエティ編集長  

    　More details

    Country：Japan

    researchmap

  • 功労感謝状

    2005.9   電子情報通信学会基礎・境界ソサイエティ  

    　More details

    Country：Japan

    researchmap

  • 情報処理学会論文賞

    2004.5   情報処理学会  

    　More details

    Country：Japan

    researchmap

  • 1994年 暗号と情報セキュリティシンポジウム論文賞

    1994.1   電子情報通信学会情報セキュリティ研究専門委員会  

    　More details

    Country：Japan

    researchmap

▼display all

Research Projects

  • 量子力学的特性を利用したデータセキュリティ技術の創出

    Grant number：22K11914  2022.4 - 2025.3

    日本学術振興会  科学研究費助成事業  基盤研究(C)

    桑門 秀典, 廣瀬 勝一, 満保 雅浩

    　 More details

    Grant amount：\4160000 （ Direct Cost: \3200000 、 Indirect Cost：\960000 ）

    researchmap

  • 応用の広がりを考慮した暗号方式の設計と評価

    Grant number：21K11885  2021.4 - 2024.3

    日本学術振興会  科学研究費助成事業  基盤研究(C)

    廣瀬 勝一, 桑門 秀典, 満保 雅浩

    　 More details

    Grant amount：\4030000 （ Direct Cost: \3100000 、 Indirect Cost：\930000 ）

    本研究の課題は「(1) 軽量暗号方式の設計と評価」と「(2) 応用が要求する機能を有する暗号方式の設計と評価」である。
    課題(1)について，(a)衝突計算困難性を有する擬似ランダムハッシュ関数を提案した。これは，Merkle-Damgaardハッシュ関数に基づく鍵付きハッシュ関数であり，圧縮関数の計算回数最小化を達成しており，同じ安全性を有する標準鍵付きハッシュ関数HMACよりも効率が良い。このハッシュ関数が衝突計算困難性を有することと，擬似ランダム関数であることは，それぞれについて圧縮関数が満たすべき十分条件が提示され，数学的な証明により示されている。この成果については国際会議ICISC 2021で発表した。なお，近年，共通鍵認証暗号の実用について，衝突計算困難性を有する擬似ランダムハッシュ関数の興味深い役割が指摘されており，この成果は課題(2)にも関連する。(b)耐量子計算機暗号の有力候補の一つである同種写像暗号について，GPUを有する組み込み型プロセッサにおける軽量実装を目標として，多倍長演算をGPUで行うことを検討した。同種写像暗号は他の方式と比較して計算量が多いことが欠点であるが，本研究では，GPUが有する Cooperative Groups の機能に着目し，それを利用した計算速度向上とCPU負荷軽減を目指して実装を行っている。
    課題(2) について，ハッシュ関数を用いるブルームフィルタを応用した正規表現向け検索可能暗号の安全性について評価を行い、安全性を保障するための条件について考察した。

    researchmap

  • Management schemes for secret information using no-cloning property of quantum state

    Grant number：20K21798  2020.7 - 2022.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Challenging Research (Exploratory)

    Kuwakado Hidenori

    　 More details

    Grant amount：\6370000 （ Direct Cost: \4900000 、 Indirect Cost：\1470000 ）

    Applications that store secret digital information in devices (equipment) used by users have a risk of leakage of the secret due to internal analysis by users. In this research, we proposed a scheme that can prevent information leakage in principle by storing information in a quantum state. We showed that the probability of obtaining useful information is negligible even when amplitude amplification by the generalized Grover algorithm is performed on the quantum state given to the attacker. We also clarified the sufficient conditions for a non-cryptographic permutation that maximizes the query computational complexity when a quantum computer is used to find collisions of a double block-length compression function consisting of the permutation and a random oracle.

    researchmap

  • Research of authentication schemes available to low computational resource sensor devices

    Grant number：18H03241  2018.4 - 2021.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)

    KUWAKADO Hidenori

    　 More details

    Grant amount：\17290000 （ Direct Cost: \13300000 、 Indirect Cost：\3990000 ）

    PUF, Fuzzy extractor, and authentication protocol were comprehensively examined so that the authentication protocol can be executed by sensor devices with low computational resources. Programmable analog ICs on which analog front-end circuits for sensors are implemented can be used as PUF. We proposed a secret sharing method on an integer ring as a tool for Fuzzy extractors, and showed Fuzzy extractors using NTRU public-key cryptosystem. The lightweight block cipher required for authentication protocols was implemented in FPGA from C language programs by high-level synthesis, and the relationship between the description in C language and power consumption was investigated.

    researchmap

  • Security Analyses of Standardized Cryptographic Schemes and Their Applications

    Grant number：16H02828  2016.4 - 2019.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)

    Hirose Shoichi

    　 More details

    Grant amount：\16900000 （ Direct Cost: \13000000 、 Indirect Cost：\3900000 ）

    Our major contribution is to use primitives of standardized cryptographic schemes and design new schemes as secure as and more efficient than the standardized schemes for symmetric-key cryptography. The security of the proposed schemes are confirmed by mathematical proofs. For public-key cryptography, we extend a cryptanalytic algorithm for encryption schemes based on error-correcting codes and evaluate its performance.

    researchmap

▼display all