Keitaro Hashimoto
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
Keitaro Hashimoto has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Atsushi Sugiyama
Department of Pharmacology, Faculty of Medicine, Toho University, Tokyo, Japan
4 shared publications - Wakaha Ogata
Institute of Science Tokyo
4 shared publications - Keisuke Hara
National Institute of Advanced Industrial Science and Technology (AIST)
3 shared publications Shigeru Motomura
Hirosaki University School of Medicine
2 shared publicationsAkihiko Haruno
Department of Pharmacology, Yamanashi Medical College
1 shared publicationAkio Yamada
Department of Pharmacology, Yamanashi Medical University, Japan
1 shared publication
Latest Publications
- Open Access
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Signatures with Tight Adaptive Corruptions from Search Assumptions
In this paper, we show that tightly secure signature schemes in the multi-user setting with adaptive corruptions can be achieved from various weak assumptions, such as classical discrete logarithm, RSA, factoring, and even the post-quantum group action discrete logarithm assumption, at the cost of signature length. To this end, we introduce a new framework to construct a signature scheme. Our construction is a combination of an identification scheme with multiple secret keys per public key (with additional specific features) and (randomized) Fischlin transformation. From the straight-line extractability of the transformation, intuitively unforgeability can be tightly reduced to the soundness of an identification scheme in the programmable random oracle model (PROM). Our careful security proof succeeds in a tight reduction in the non-programmable random oracle model (NPROM).As a complementary study, we analyze the multi-user security of hash-based signatures. Although hash-based signatures seem to be tightly secure in the multi-user setting with adaptive corruptions (at the cost of signature lengths similar to our construction), their security has not been closely analyzed. We show the tight security based on collision resistance of the underlying hash function by modeling the pseudo-random function for key generation as a (programmable) random oracle. By using a hash function whose security is tightly reduced to other assumptions, such as the discrete logarithm problem, we also obtain a tightly secure signature based on them. However, the concrete signature size is larger than our proposal based on an identification scheme, and the security reduction is in the PROM in contrast to our new framework.
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Open AccessSignatures with Tight Adaptive Corruptions from Search Assumptions
In this paper, we show that tightly secure signature schemes in the multi-user setting with adaptive corruptions can be achieved from various weak assumptions, such as classical discrete logarithm, RSA, factoring, and even the post-quantum group action discrete logarithm assumption, at the cost of signature length. To this end, we introduce a new framework to construct a signature scheme. Our construction is a combination of an identification scheme with multiple secret keys per public key (with additional specific features) and (randomized) Fischlin transformation. From the straight-line extractability of the transformation, intuitively unforgeability can be tightly reduced to the soundness of an identification scheme in the programmable random oracle model (PROM). Our careful security proof succeeds in a tight reduction in the non-programmable random oracle model (NPROM).As a complementary study, we analyze the multi-user security of hash-based signatures. Although hash-based signatures seem to be tightly secure in the multi-user setting with adaptive corruptions (at the cost of signature lengths similar to our construction), their security has not been closely analyzed. We show the tight security based on collision resistance of the underlying hash function by modeling the pseudo-random function for key generation as a (programmable) random oracle. By using a hash function whose security is tightly reduced to other assumptions, such as the discrete logarithm problem, we also obtain a tightly secure signature based on them. However, the concrete signature size is larger than our proposal based on an identification scheme, and the security reduction is in the PROM in contrast to our new framework.
- 13 August 2026
- Published by Springer Nature
- p. 399-431
Asymmetric Message Franking in the Plain Model: Generic and Efficient Constructions
- 13 August 2026
- Published by Springer Nature
- p. 399-431
Asymmetric Message Franking in the Plain Model: Generic and Efficient Constructions
- 24 July 2026
- Published by Springer Nature
- p. 338-367
(Re-)Formalization and Construction of Reusable and Robust Threshold Fuzzy Extractors
- 24 July 2026
- Published by Springer Nature
- p. 338-367
(Re-)Formalization and Construction of Reusable and Robust Threshold Fuzzy Extractors
- Open Access
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Round-Optimal Authenticated Key Exchange with Full Forward Privacy
Privacy-preserving authenticated key exchange (PPAKE) is a cryptographic protocol that enables two users to exchange a session key while protecting users' privacy (i.e., hiding the user's identity) against the machine-in-the-middle adversary. To hide user identities, PPAKE messages are broadcast to the network, increasing communication complexity. In ASIACRYPT2022, Lyu et al. introduced a concept of robustness to reduce communication complexity. Roughly, robust PPAKE allows receivers to decide whether it is the intended user by processing the first message with its long-term secret key. As a result, only the intended user replies to the first message, and thus, messages in the network are reduced. However, if a user's secret key is leaked, an adversary can also use it to determine whether the past first message was intended for the user, and thus, the PPAKE scheme of Lyu et al. does not have full forward privacy. Lyu et al. leave an open problem of constructing a PPAKE scheme with robustness and full forward privacy. In this work, we solve this problem by introducing a new framework called key updatable PPAKE (kuPPAKE). In kuPPAKE schemes, a long-term secret key is updated so that the updated key does not work for past messages. Therefore, robustness no longer conflicts with full forward privacy. We propose a generic construction of a 2-round kuPPAKE and show a concrete scheme in the standard model from DH-style assumptions over bilinear groups.
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Open AccessRound-Optimal Authenticated Key Exchange with Full Forward Privacy
Privacy-preserving authenticated key exchange (PPAKE) is a cryptographic protocol that enables two users to exchange a session key while protecting users' privacy (i.e., hiding the user's identity) against the machine-in-the-middle adversary. To hide user identities, PPAKE messages are broadcast to the network, increasing communication complexity. In ASIACRYPT2022, Lyu et al. introduced a concept of robustness to reduce communication complexity. Roughly, robust PPAKE allows receivers to decide whether it is the intended user by processing the first message with its long-term secret key. As a result, only the intended user replies to the first message, and thus, messages in the network are reduced. However, if a user's secret key is leaked, an adversary can also use it to determine whether the past first message was intended for the user, and thus, the PPAKE scheme of Lyu et al. does not have full forward privacy. Lyu et al. leave an open problem of constructing a PPAKE scheme with robustness and full forward privacy. In this work, we solve this problem by introducing a new framework called key updatable PPAKE (kuPPAKE). In kuPPAKE schemes, a long-term secret key is updated so that the updated key does not work for past messages. Therefore, robustness no longer conflicts with full forward privacy. We propose a generic construction of a 2-round kuPPAKE and show a concrete scheme in the standard model from DH-style assumptions over bilinear groups.
- 5 May 2025
- Published by Springer Nature
- p. 102-133
Key Revocation in Registered Attribute-Based Encryption
- 5 May 2025
- Published by Springer Nature
- p. 102-133
Key Revocation in Registered Attribute-Based Encryption
- 29 September 2024
- Published by Springer Nature
- p. 145-165
How to Apply Fujisaki-Okamoto Transformation to Registration-Based Encryption
- 29 September 2024
- Published by Springer Nature
- p. 145-165
How to Apply Fujisaki-Okamoto Transformation to Registration-Based Encryption
- 10 September 2024
- Published by Springer Nature
- p. 251-271
Security Model for Authenticated Key Exchange, Reconsidered
- 10 September 2024
- Published by Springer Nature
- p. 251-271
Security Model for Authenticated Key Exchange, Reconsidered
- Open Access
- 12 October 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 277-301
Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
Threshold public-key encryption (threshold PKE) has various useful applications. A lot of threshold PKE schemes are proposed based on RSA, Diffie–Hellman and lattice, but to the best of our knowledge, code-based threshold PKEs have not been proposed. In this paper, we provide three IND-CCA secure code-based threshold PKE schemes. The first scheme is the concrete instantiation of Dodis–Katz conversion (Dodis and Katz, TCC’05) that converts an IND-CCA secure PKE into an IND-CCA secure threshold PKE using parallel encryption and a signature scheme. This approach provides non-interactive threshold decryption, but ciphertexts are large (about 16 kilobytes for 128-bit security) due to long code-based signatures even in the state-of-the-art one. The second scheme is a new parallel encryption-based construction without signature schemes. Unlike the Dodis–Katz conversion, our parallel encryption converts an OW-CPA secure PKE into an OW-CPA secure threshold PKE. To enhance security, we use Cong et al.’s conversion (Cong et al., ASIACRYPT’21). Thanks to eliminating signatures, its ciphertext is 512 bytes, which is only 3% of the first scheme. The decryption process needs an MPC for computing hash functions, but decryption of OW-CPA secure PKE can be done locally. The third scheme is an MPC-based threshold PKE scheme from code-based assumption. We take the same approach Cong et al. took to construct efficient lattice-based threshold PKEs. We build an MPC for the decryption algorithm of OW-CPA secure Classic McEliece PKE. This scheme has the shortest ciphertext among the three schemes at just 192 bytes. Compared to the regular CCA secure Classic McEliece PKE, the additional ciphertext length is only 100 bytes. The cons are heavy distributed computation in the decryption process.
- 12 October 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 277-301
Open AccessChosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
Threshold public-key encryption (threshold PKE) has various useful applications. A lot of threshold PKE schemes are proposed based on RSA, Diffie–Hellman and lattice, but to the best of our knowledge, code-based threshold PKEs have not been proposed. In this paper, we provide three IND-CCA secure code-based threshold PKE schemes. The first scheme is the concrete instantiation of Dodis–Katz conversion (Dodis and Katz, TCC’05) that converts an IND-CCA secure PKE into an IND-CCA secure threshold PKE using parallel encryption and a signature scheme. This approach provides non-interactive threshold decryption, but ciphertexts are large (about 16 kilobytes for 128-bit security) due to long code-based signatures even in the state-of-the-art one. The second scheme is a new parallel encryption-based construction without signature schemes. Unlike the Dodis–Katz conversion, our parallel encryption converts an OW-CPA secure PKE into an OW-CPA secure threshold PKE. To enhance security, we use Cong et al.’s conversion (Cong et al., ASIACRYPT’21). Thanks to eliminating signatures, its ciphertext is 512 bytes, which is only 3% of the first scheme. The decryption process needs an MPC for computing hash functions, but decryption of OW-CPA secure PKE can be done locally. The third scheme is an MPC-based threshold PKE scheme from code-based assumption. We take the same approach Cong et al. took to construct efficient lattice-based threshold PKEs. We build an MPC for the decryption algorithm of OW-CPA secure Classic McEliece PKE. This scheme has the shortest ciphertext among the three schemes at just 192 bytes. Compared to the regular CCA secure Classic McEliece PKE, the additional ciphertext length is only 100 bytes. The cons are heavy distributed computation in the decryption process.
- 5 May 2022
- Published by Springer Nature in Journal of Cryptology
- Vol. 35 (3) , 1-78
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable
- 5 May 2022
- Published by Springer Nature in Journal of Cryptology
- Vol. 35 (3) , 1-78
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable
- 1 May 2021
- Published by Springer Nature
- p. 410-440
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-Quantum, State Leakage Secure, and Deniable
- 1 May 2021
- Published by Springer Nature
- p. 410-440
An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-Quantum, State Leakage Secure, and Deniable