Keisuke Hara
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
Keisuke Hara has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Junji Shikata
Yokohama National University
5 shared publications - Kyosuke Yamashita
The University of Osaka, Suita-shi, Osaka, Japan
5 shared publications - Keisuke Tanaka
Tokyo Institute of Technology
4 shared publications - Masayuki Tezuka
Institute of Science Tokyo
4 shared publications - Sohto Chiku
Yokohama National University
4 shared publications - Yusuke Yoshida
Tokyo Institute of Technology
4 shared publications
Latest Publications
- 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
- 1 December 2025
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E108.D (12) , 1526-1537
Efficient Two-Party Exponentiation from Quotient Transfer
Secure multi-party computation (MPC) allows participating parties to jointly compute a function over their inputs while keeping them private. In particular, MPC based on additive secret sharing has been widely studied as a tool to obtain efficient protocols secure against a dishonest majority, including the important two-party case. In this paper, we propose a two-party protocol for an exponentiation functionality based on an additive secret sharing scheme. Our proposed protocol aims to securely compute a public base exponentiation ax mod p for an odd prime p, where the exponent x ∈ ℤp is a (shared) secret and the base a ∈ ℤp is public. Our protocol is based on a new simple but efficient approach involving quotient transfer that allows the parties to perform the most expensive part of the computation locally, but requires the base a ∈ ℤp to be a quadratic residue. To address scenarios where the base does not fulfill this, we combine our exponentiation protocol with a new efficient modulus conversion protocol which might be of independent interest. Even taking into account a potential modulus conversion, our exponentiation protocol only requires 3 rounds and 4 invocations of multiplication.
- 1 December 2025
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E108.D (12) , 1526-1537
Open AccessEfficient Two-Party Exponentiation from Quotient Transfer
Secure multi-party computation (MPC) allows participating parties to jointly compute a function over their inputs while keeping them private. In particular, MPC based on additive secret sharing has been widely studied as a tool to obtain efficient protocols secure against a dishonest majority, including the important two-party case. In this paper, we propose a two-party protocol for an exponentiation functionality based on an additive secret sharing scheme. Our proposed protocol aims to securely compute a public base exponentiation ax mod p for an odd prime p, where the exponent x ∈ ℤp is a (shared) secret and the base a ∈ ℤp is public. Our protocol is based on a new simple but efficient approach involving quotient transfer that allows the parties to perform the most expensive part of the computation locally, but requires the base a ∈ ℤp to be a quadratic residue. To address scenarios where the base does not fulfill this, we combine our exponentiation protocol with a new efficient modulus conversion protocol which might be of independent interest. Even taking into account a potential modulus conversion, our exponentiation protocol only requires 3 rounds and 4 invocations of multiplication.
- 26 October 2025
- Published by Springer Nature
- p. 274-295
Hierarchical Identity-Based Matchmaking Encryption
- 26 October 2025
- Published by Springer Nature
- p. 274-295
Hierarchical Identity-Based Matchmaking Encryption
- 10 October 2025
- Published by Springer Nature
- p. 44-64
Logarithmic-Size Ring Signatures with Tight Security from the DL Assumption
- 10 October 2025
- Published by Springer Nature
- p. 44-64
Logarithmic-Size Ring Signatures with Tight Security from the DL Assumption
- Open Access
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 44-53
Practical Quantum Public Key Encryption from One-way Functions
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 44-53
Open AccessPractical Quantum Public Key Encryption from One-way Functions
- 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
- 14 March 2025
- Published by Springer Nature
- p. 3-20
How to Accomplish Key and Communication Compression Over Authentication Channels
- 14 March 2025
- Published by Springer Nature
- p. 3-20
How to Accomplish Key and Communication Compression Over Authentication Channels
- Open Access
- 1 February 2025
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E108.A (2) , 104-116
Quantum Search-to-Decision Reduction for the LWE Problem
The learning with errors (LWE) problem is one of the fundamental problems in cryptography and it has many applications in post-quantum cryptography. There are two variants of the problem, the decisional-LWE problem, and the search-LWE problem. LWE search-to-decision reduction shows that the hardness of the search-LWE problem can be reduced to the hardness of the decisional-LWE problem. The efficiency of the reduction can be regarded as the gap in difficulty between the problems. We initiate a study of quantum search-to-decision reduction for the LWE problem and propose a reduction that satisfies sample-preserving. In sample-preserving reduction, it preserves all parameters even the number of instances. Especially, our quantum reduction invokes the distinguisher only 2 times to solve the search-LWE problem, while classical reductions require a polynomial number of invocations. Furthermore, we give a way to amplify the success probability of the reduction algorithm. Our amplified reduction is incomparable to the classical reduction in terms of sample complexity and query complexity. Our reduction algorithm supports a wide class of error distributions and also provides a search-to-decision reduction for the learning parity with noise problem. In the process of constructing the search-to-decision reduction, we give a quantum Goldreich-Levin theorem over ℤq where q is a prime. In short, this theorem states that, if a hardcore predicate a · s (mod q) can be predicted with probability distinctly greater than 1/q with respect to a uniformly random a ∈ ℤnq, then it is possible to determine s ∈ ℤnq.
- 1 February 2025
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E108.A (2) , 104-116
Open AccessQuantum Search-to-Decision Reduction for the LWE Problem
The learning with errors (LWE) problem is one of the fundamental problems in cryptography and it has many applications in post-quantum cryptography. There are two variants of the problem, the decisional-LWE problem, and the search-LWE problem. LWE search-to-decision reduction shows that the hardness of the search-LWE problem can be reduced to the hardness of the decisional-LWE problem. The efficiency of the reduction can be regarded as the gap in difficulty between the problems. We initiate a study of quantum search-to-decision reduction for the LWE problem and propose a reduction that satisfies sample-preserving. In sample-preserving reduction, it preserves all parameters even the number of instances. Especially, our quantum reduction invokes the distinguisher only 2 times to solve the search-LWE problem, while classical reductions require a polynomial number of invocations. Furthermore, we give a way to amplify the success probability of the reduction algorithm. Our amplified reduction is incomparable to the classical reduction in terms of sample complexity and query complexity. Our reduction algorithm supports a wide class of error distributions and also provides a search-to-decision reduction for the learning parity with noise problem. In the process of constructing the search-to-decision reduction, we give a quantum Goldreich-Levin theorem over ℤq where q is a prime. In short, this theorem states that, if a hardcore predicate a · s (mod q) can be predicted with probability distinctly greater than 1/q with respect to a uniformly random a ∈ ℤnq, then it is possible to determine s ∈ ℤnq.
- 29 January 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1033
A linkable ring signature scheme with unconditional anonymity in the standard model
- 29 January 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1033
A linkable ring signature scheme with unconditional anonymity in the standard model