Hiraku Morita
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hiraku Morita has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Goichiro Hanaoka
National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
2 shared publications Nuttapong Attrapadung
AIST
2 shared publicationsGoichiro Hanaoka
AIST
1 shared publication- Jacob C. N. Schuldt
National Institute of Advanced Industrial Science and Technology (AIST)
1 shared publication Koji Nuida
The University of Tokyo
1 shared publication- Koji Nuida
Institute of Mathematics for Industry (IMI), Kyushu University
1 shared publication
Latest Publications
- 1 January 2020
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E103.A (1) , 21-32
Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications
We present an improved constant-round secure two-party protocol for integer comparison functionality, which is one of the most fundamental building blocks in secure computation. Our protocol is in the so-called client-server model, which is utilized in real-world MPC products such as Sharemind, where any number of clients can create shares of their input and distribute to the servers who then jointly compute over the shares and return the shares of the result to the client. In the client-aided client-server model, as mentioned briefly by Mohassel and Zhang (S&P'17), a client further generates and distributes some necessary correlated randomness to servers. Such correlated randomness admits efficient protocols since otherwise, servers have to jointly generate randomness by themselves, which can be inefficient. In this paper, we improve the state-of-the-art constant-round comparison protocols by Damgå rd et al. (TCC'06) and Nishide and Ohta (PKC'07) in the client-aided model. Our techniques include identifying correlated randomness in these comparison protocols. Along the way, we also use tree-based techniques for a building block, which deviate from the above two works. Our proposed protocol requires only 5 communication rounds, regardless of the bit length of inputs. This is at least 5 times fewer rounds than existing protocols. We implement our secure comparison protocol in C++. Our experimental results show that this low-round complexity benefits in high-latency networks such as WAN. We also present secure Min/Argmin protocols using the secure comparison protocol.
- 1 January 2020
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E103.A (1) , 21-32
Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications
We present an improved constant-round secure two-party protocol for integer comparison functionality, which is one of the most fundamental building blocks in secure computation. Our protocol is in the so-called client-server model, which is utilized in real-world MPC products such as Sharemind, where any number of clients can create shares of their input and distribute to the servers who then jointly compute over the shares and return the shares of the result to the client. In the client-aided client-server model, as mentioned briefly by Mohassel and Zhang (S&P'17), a client further generates and distributes some necessary correlated randomness to servers. Such correlated randomness admits efficient protocols since otherwise, servers have to jointly generate randomness by themselves, which can be inefficient. In this paper, we improve the state-of-the-art constant-round comparison protocols by Damgå rd et al. (TCC'06) and Nishide and Ohta (PKC'07) in the client-aided model. Our techniques include identifying correlated randomness in these comparison protocols. Along the way, we also use tree-based techniques for a building block, which deviate from the above two works. Our proposed protocol requires only 5 communication rounds, regardless of the bit length of inputs. This is at least 5 times fewer rounds than existing protocols. We implement our secure comparison protocol in C++. Our experimental results show that this low-round complexity benefits in high-latency networks such as WAN. We also present secure Min/Argmin protocols using the secure comparison protocol.
- 11 October 2019
- Published by Springer Nature
- p. 328-343
Client-Aided Two-Party Secure Interval Test Protocol
- 11 October 2019
- Published by Springer Nature
- p. 328-343
Client-Aided Two-Party Secure Interval Test Protocol
- 7 August 2018
- Published by Springer Nature
- p. 395-415
Constant-Round Client-Aided Secure Comparison Protocol
- 7 August 2018
- Published by Springer Nature
- p. 395-415
Constant-Round Client-Aided Secure Comparison Protocol
- 1 January 2017
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E100.A (9) , 1910-1923
On the Security of Non-Interactive Key Exchange against Related-Key Attacks
- 1 January 2017
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E100.A (9) , 1910-1923
On the Security of Non-Interactive Key Exchange against Related-Key Attacks