Satoshi Obana
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Satoshi Obana has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Maki Yoshida
NICT
5 shared publications - Sumio Morioka
Interstellar Technologies Inc
2 shared publications - Haruna Higo
NEC Corporation
1 shared publication - Hidetaka Hoshino
Hosei University
1 shared publication Hiroto Tamiya
NEC Corporation, Japan
1 shared publicationKaichi Sato
Graduate School of Computer and Information Sciences Hosei University, Tokyo, Japan
1 shared publication
Latest Publications
- 19 November 2026
- Published by Springer Nature
- p. 407-434
Round-Efficient MPC with Applications to Privacy-Preserving Machine Learning
- 19 November 2026
- Published by Springer Nature
- p. 407-434
Round-Efficient MPC with Applications to Privacy-Preserving Machine Learning
- 13 June 2024
- Published by Springer Nature
- p. 499-508
Feasibility Study with Actual Space Rockets Towards Information Theoretically Secure Radio Communication
- 13 June 2024
- Published by Springer Nature
- p. 499-508
Feasibility Study with Actual Space Rockets Towards Information Theoretically Secure Radio Communication
- 1 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 372-378
Cheating Detectable Secret Sharing Scheme from Multiplicative Homomorphic Authentication Function
Cheating Detectable Secret Sharing (CDSS for short) is a secret sharing scheme that adds the property of detecting the presence of cheaters submitting invalid shares when reconstructing a secret. A major topic of research in CDSS has been the attempt to improve efficiency with suitable authentication functions. In this paper, we construct CDSS based on an authentication function with multiplicative homomorphism, which has not been employed so far. It possesses some interesting properties and possesses the advantage that security can be proven simply by showing possession of such properties. Furthermore, we construct a secure CDSS with multiplicative homomorphic under some parameter constraints and show that this scheme is sufficient for practical use. The scheme achieves a bit length that is one bit longer than the theoretical lower bound.
- 1 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 372-378
Cheating Detectable Secret Sharing Scheme from Multiplicative Homomorphic Authentication Function
Cheating Detectable Secret Sharing (CDSS for short) is a secret sharing scheme that adds the property of detecting the presence of cheaters submitting invalid shares when reconstructing a secret. A major topic of research in CDSS has been the attempt to improve efficiency with suitable authentication functions. In this paper, we construct CDSS based on an authentication function with multiplicative homomorphism, which has not been employed so far. It possesses some interesting properties and possesses the advantage that security can be proven simply by showing possession of such properties. Furthermore, we construct a secure CDSS with multiplicative homomorphic under some parameter constraints and show that this scheme is sufficient for practical use. The scheme achieves a bit length that is one bit longer than the theoretical lower bound.
- 1 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Improved Post-quantum-secure Face Template Protection System Based on Packed Homomorphic Encryption
This paper proposes an efficient face template protection system based on homomorphic encryption. By developing a message packing method suitable for the calculation of the squared Euclidean distance, the proposed system computes the squared Euclidean distance between facial features by a single homomorphic multiplication. Our experimental results show the transaction time of the proposed system is about 14 times faster than that of the existing face template protection system based on homomorphic encryption presented in BIOSIG2020.
- 1 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Improved Post-quantum-secure Face Template Protection System Based on Packed Homomorphic Encryption
This paper proposes an efficient face template protection system based on homomorphic encryption. By developing a message packing method suitable for the calculation of the squared Euclidean distance, the proposed system computes the squared Euclidean distance between facial features by a single homomorphic multiplication. Our experimental results show the transaction time of the proposed system is about 14 times faster than that of the existing face template protection system based on homomorphic encryption presented in BIOSIG2020.
- 11 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (5) , 3233-3245
Verifiably Multiplicative Secret Sharing
- 11 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (5) , 3233-3245
Verifiably Multiplicative Secret Sharing
- Open Access
- 26 March 2018
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1793-1805
On the (in)efficiency of non-interactive secure multiparty computation
- 26 March 2018
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1793-1805
Open AccessOn the (in)efficiency of non-interactive secure multiparty computation
- 28 October 2016
- Published by Springer Nature
- p. 604-614
An Efficient Construction of Non-Interactive Secure Multiparty Computation
- 28 October 2016
- Published by Springer Nature
- p. 604-614
An Efficient Construction of Non-Interactive Secure Multiparty Computation
- 10 March 2016
- Published by Springer Nature
- p. 185-193
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
- 10 March 2016
- Published by Springer Nature
- p. 185-193
On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
- 1 January 2016
- Published by Springer Nature
- p. 44-64
Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks
- 1 January 2016
- Published by Springer Nature
- p. 44-64
Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks