Koji Nuida

Prof. Koji Nuida

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 October 2010 in Reports on Mathematical Physics
Verified
Journal Article
Closed access
GKGen Kimura
Gen Kimura
KNKoji Nuida
Koji Nuida
HIHideki Imai
Hideki Imai

2 April 2009 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
KNKoji Nuida
Koji Nuida
SFSatoshi Fujitsu
Satoshi Fujitsu
MHManabu Hagiwara
Manabu Hagiwara
TKTakashi Kitagawa
Takashi Kitagawa
HWHajime Watanabe
Hajime Watanabe
HIHideki Imai
Hideki Imai

2 March 2016 in Bioinformatics
Verified
Journal Article
Open access
PDF file
KSKana Shimizu
Kana Shimizu
KNKoji Nuida
Koji Nuida
GRGunnar Rätsch
Gunnar Rätsch
Motivation: Personal genomes carry inherent privacy risks and protecting privacy poses major social and technological challenges. We consider the case where a user searches for genetic information (e.g. an allele) on a server that stores a large genomic database and aims to receive allele-associated information. The user would like to keep the query and result private and the server the database. Approach: We propose a novel approach that combines efficient string data structures such as the Burrows–Wheeler transform with cryptographic techniques based on additive homomorphic encryption. We assume that the sequence data is searchable in efficient iterative query operations over a large indexed dictionary, for instance, from large genome collections and employing the (positional) Burrows–Wheeler transform. We use a technique called oblivious transfer that is based on additive homomorphic encryption to conceal the sequence query and the genomic region of interest in positional queries. Results: We designed and implemented an efficient algorithm for searching sequences of SNPs in large genome databases. During search, the user can only identify the longest match while the server does not learn which sequence of SNPs the user queried. In an experiment based on 2184 aligned haploid genomes from the 1000 Genomes Project, our algorithm was able to perform typical queries within ≈ 4.6 s and ≈ 10.8 s for client and server side, respectively, on laptop computers. The presented algorithm is at least one order of magnitude faster than an exhaustive baseline algorithm. Availability and implementation:https://github.com/iskana/PBWT-sec and https://github.com/ratschlab/PBWT-sec. Contacts:shimizu-kana@aist.go.jp or Gunnar.Ratsch@ratschlab.org Supplementary information: Supplementary data are available at Bioinformatics online.

1 January 2021 in Discrete Applied Mathematics
Verified
Journal Article
Open access
KSKazumasa Shinagawa
Kazumasa Shinagawa
KNKoji Nuida
Koji Nuida

14 April 2015
Verified
Book Chapter
Closed access
PDF file
KNKoji Nuida
Koji Nuida
KKKaoru Kurosawa
Kaoru Kurosawa

22 May 2009 in Journal of the London Mathematical Society
Verified
Journal Article
Closed access
PDF file
TATakuro Abe
Takuro Abe
KNKoji Nuida
Koji Nuida
YNYasuhide Numata
Yasuhide Numata