Shinsaku Kiyomoto

Dr. Shinsaku Kiyomoto


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 May 2017 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
TTThao Tran
Thao Tran
MRMohammad Rahman
Mohammad Rahman
MBMd Zakirul Alam Bhuiyan
Md Zakirul Alam Bhuiyan
AKAyumu Kubota
Ayumu Kubota
SKShinsaku Kiyomoto
Shinsaku Kiyomoto
KOKazumasa Omote
Kazumasa Omote
Secret sharing scheme has been applied commonly in distributed storage for Big Data. It is a method for protecting outsourced data against data leakage and for securing key management systems. The secret is distributed among a group of participants where each participant holds a share of the secret. The secret can be only reconstructed when a sufficient number of shares are reconstituted. Although many secret sharing schemes have been proposed, they are still inefficient in terms of share size, communication cost and storage cost; and also lack robustness in terms of exact-share repair. In this paper, for the first time, we propose a new secret sharing scheme based on Slepian-Wolf coding. Our scheme can achieve an optimal share size utilizing the simple binning idea of the coding. It also enhances the exact-share repair feature whereby the shares remain consistent even if they are corrupted. We show, through experiments, how our scheme can significantly reduce the communication and storage cost while still being able to support direct share repair leveraging lightweight exclusive-OR (XOR) operation for fast computation.

1 January 2017
Verified
Conference Paper
Closed access
MRMohammad Shahriar Rahman
Mohammad Shahriar Rahman
ABAnirban Basu
Anirban Basu
SKShinsaku Kiyomoto
Shinsaku Kiyomoto
This article proposes a privacy-preserving quantum-secure protocol for the DBSCAN clustering algorithm. It allows multiple parties to jointly compute clusters without revealing their individual datasets to each other. We show how to outsource the DBSCAN computation on encrypted data to a cloud service provider securely such that the parties do not need to perform the expensive clustering computation locally. We also discuss some future research directions at the end of the paper.

4 November 2021
Verified
Book Chapter
Closed access
PDF file
ATAnh The Ta
Anh The Ta
TKThanh Xuan Khuc
Thanh Xuan Khuc
TNTuong Ngoc Nguyen
Tuong Ngoc Nguyen
HLHuy Quoc Le
Huy Quoc Le
DDDung Hoang Duong
Dung Hoang Duong
SKShinsaku Kiyomoto
Shinsaku Kiyomoto

22 September 2022
Verified
Book Chapter
Closed access
PDF file
TNTuong Ngoc Nguyen
Tuong Ngoc Nguyen
ATAnh The Ta
Anh The Ta
HLHuy Quoc Le
Huy Quoc Le
DDDung Hoang Duong
Dung Hoang Duong
Willy SusiloWilly Susilo
Willy Susilo
SKShinsaku Kiyomoto
Shinsaku Kiyomoto

1 January 2021
Verified
Conference Paper
Open access
PDF file
HNHoang-Quoc Nguyen-Son
Hoang-Quoc Nguyen-Son
TTTran Thao
Tran Thao
SHSeira Hidano
Seira Hidano
IGIshita Gupta
Ishita Gupta
SKShinsaku Kiyomoto
Shinsaku Kiyomoto
Hoang-Quoc Nguyen-Son, Tran Thao, Seira Hidano, Ishita Gupta, Shinsaku Kiyomoto. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021.

26 July 2021 in Information
Verified
Journal Article
Open access
PDF file
HOHiroki Okada
Hiroki Okada
SKShinsaku Kiyomoto
Shinsaku Kiyomoto
CCCarlos Cid
Carlos Cid
TFHE is a fast fully homomorphic encryption scheme proposed by Chillotti et al. in Asiacrypt’ 2018. Integer-wise TFHE is a generalized version of TFHE that can encrypt the plaintext of an integer that was implicitly presented by Chillotti et al., and Bourse et al. presented the actual form of the scheme in CRYPTO’ 2018. However, Bourse et al.’s scheme provides only homomorphic integer additions and homomorphic evaluations of a sign function. In this paper, we construct a technique for operating any 1-variable function in only one bootstrapping of the integer-wise TFHE. For applications of the scheme, we also construct a useful homomorphic evaluation of several integer arithmetics: division, equality test, and multiplication between integer and binary numbers. Our implementation results show that our homomorphic division is approximately 3.4 times faster than any existing work and that its run time is less than 1 second for 4-bit integer inputs.