Optimal probabilistic fingerprinting codes using optimal finite random variables related to numerical quadrature - Koji Nuida; Manabu Hagiwara; Hajime Watanabe; Hideki Imai (CoRR, 2006)

An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths. - Koji Nuida; Satoshi Fujitsu; Manabu Hagiwara; Takashi Kitagawa; Hajime Watanabe; Kazuto Ogawa; Hideki Imai (AAECC, 2007)

A Tracing Algorithm for Short 2-Secure Probabilistic Fingerprinting Codes Strongly Protecting Innocent Users. - Satoshi Fujitsu; Koji Nuida; Manabu Hagiwara; Takashi Kitagawa; Hajime Watanabe; Kazuto Ogawa; Hideki Imai (CCNC, 2007)

Optimization of Tardos's Fingerprinting Codes in a Viewpoint of Memory Amount. - Koji Nuida; Manabu Hagiwara; Hajime Watanabe; Hideki Imai (Information Hiding, 2007)

A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure. - Koji Nuida (ICITS, 2009)

An Improvement of Pseudorandomization against Unbounded Attack Algorithms - The Case of Fingerprint Codes. - Koji Nuida; Goichiro Hanaoka (ICITS, 2009)

An Improvement of Short 2-Secure Fingerprint Codes Strongly Avoiding False-Positive. - Koji Nuida (Information Hiding, 2009)

An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation. - Koji Nuida (IWSEC, 2009)

An improvement of discrete Tardos fingerprinting codes. - Koji Nuida; Satoshi Fujitsu; Manabu Hagiwara; Takashi Kitagawa; Hajime Watanabe; Kazuto Ogawa; Hideki Imai (Des. Codes Cryptogr., 2009)

Making Collusion-Secure Codes (More) Robust against Bit Erasure. - Koji Nuida (IACR Cryptol. ePrint Arch., 2009)

An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation. - Koji Nuida; Satoshi Fujitsu; Manabu Hagiwara; Hideki Imai; Takashi Kitagawa; Kazuto Ogawa; Hajime Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

A characterization of signed graphs with generalized perfect elimination orderings. - Koji Nuida (Discret. Math., 2010)

Short collusion-secure fingerprint codes against three pirates. - Koji Nuida (IACR Cryptol. ePrint Arch., 2010)

Pattern Occurrence in the Dyadic Expansion of Square Root of Two and an Analysis of Pseudorandom Number Generators. - Koji Nuida (Integers, 2010)

On pseudorandomization of information-theoretically secure schemes without hardness assumptions. - Koji Nuida (IACR Cryptol. ePrint Arch., 2012)

Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption. - Keita Emura; Goichiro Hanaoka; Koji Nuida; Go Ohtake; Takahiro Matsuda 002; Shota Yamada 001 (IACR Cryptol. ePrint Arch., 2013)

On the Security of Pseudorandomized Information-Theoretically Secure Schemes. - Koji Nuida; Goichiro Hanaoka (IEEE Trans. Inf. Theory, 2013)

How to Use Pseudorandom Generators in Unconditional Security Settings. - Koji Nuida (ProvSec, 2014)

Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues. - Takashi Yamakawa; Shota Yamada 001; Koji Nuida; Goichiro Hanaoka; Noboru Kunihiro (SCN, 2014)

A Simple Framework for Noise-Free Construction of Fully Homomorphic Encryption from a Special Class of Non-Commutative Groups. - Koji Nuida (IACR Cryptol. ePrint Arch., 2014)

Tree-Structured Composition of Homomorphic Encryption: How to Weaken Underlying Assumptions. - Koji Nuida; Goichiro Hanaoka; Takahiro Matsuda 002 (IACR Cryptol. ePrint Arch., 2014)

A Simple and Improved Algorithm for Integer Factorization with Implicit Hints. - Koji Nuida; Naoto Itakura; Kaoru Kurosawa (IACR Cryptol. ePrint Arch., 2014)

(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces. - Koji Nuida; Kaoru Kurosawa (IACR Cryptol. ePrint Arch., 2014)

Secure Multi-Party Computation Using Polarizing Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (IWSEC, 2015)

On Limitations and Alternatives of Privacy-Preserving Cryptographic Protocols for Genomic Data. - Tadanori Teruya; Koji Nuida; Kana Shimizu; Goichiro Hanaoka (IWSEC, 2015)

Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (ProvSec, 2015)

Polynomial Expressions of Carries in p-ary Arithmetics. - Shizuo Kaji; Toshiaki Maeno; Koji Nuida; Yasuhide Numata (CoRR, 2015)

A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators. - Koji Nuida; Takuro Abe; Shizuo Kaji; Toshiaki Maeno; Yasuhide Numata (Int. J. Found. Comput. Sci., 2015)

Privacy-preserving search for chemical compound databases. - Kana Shimizu; Koji Nuida; Hiromi Arai; Shigeo Mitsunari; Nuttapong Attrapadung; Michiaki Hamada; Koji Tsuda; Takatsugu Hirokawa; Jun Sakuma; Goichiro Hanaoka; Kiyoshi Asai (BMC Bioinform., 2015)

Size-Hiding Computation for Multiple Parties. - Kazumasa Shinagawa; Koji Nuida; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (ASIACRYPT (2), 2016)

Committed AND protocol using three cards with more handy shuffle. - Kazumasa Shinagawa; Koji Nuida; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (ISITA, 2016)

Efficient privacy-preserving string search and an application in genomics. - Kana Shimizu; Koji Nuida; Gunnar Rätsch (Bioinform., 2016)

Secure Computation Protocols Using Polarizing Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Intrinsic reflections in Coxeter systems. - Bernhard Mühlherr; Koji Nuida (J. Comb. Theory A, 2016)

Correction of a Secure Comparison Protocol for Encrypted Integers in IEEE WIFS 2012 (Short Paper). - Baptiste Vinh Mau; Koji Nuida (IWSEC, 2017)

A Public-Key Encryption Scheme Based on Non-linear Indeterminate Equations. - Koichiro Akiyama; Yasuhiro Goto; Shinya Okumura; Tsuyoshi Takagi; Koji Nuida; Goichiro Hanaoka (SAC, 2017)

A Public-key Encryption Scheme Based on Non-linear Indeterminate Equations (Giophantus). - Koichiro Akiyama; Yasuhiro Goto; Shinya Okumura; Tsuyoshi Takagi; Koji Nuida; Goichiro Hanaoka; Hideo Shimizu; Yasuhiko Ikematsu (IACR Cryptol. ePrint Arch., 2017)

Card-Based Protocols Using Regular Polygon Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Constant-Round Client-Aided Secure Comparison Protocol. - Hiraku Morita; Nuttapong Attrapadung; Tadanori Teruya; Satsuya Ohata; Koji Nuida; Goichiro Hanaoka (ESORICS (2), 2018)

Tree-based Secure Comparison of Secret Shared Data. - Hiraku Morita; Nuttapong Attrapadung; Satsuya Ohata; Shota Yamada 001; Koji Nuida; Goichiro Hanaoka (ISITA, 2018)

Secure Division Protocol and Applications to Privacy-preserving Chi-squared Tests. - Hiraku Morita; Nuttapong Attrapadung; Satsuya Ohata; Koji Nuida; Shota Yamada 001; Kana Shimizu; Goichiro Hanaoka; Kiyoshi Asai (ISITA, 2018)

Chosen ciphertext secure keyed-homomorphic public-key cryptosystems. - Keita Emura; Goichiro Hanaoka; Koji Nuida; Go Ohtake; Takahiro Matsuda 002; Shota Yamada 001 (Des. Codes Cryptogr., 2018)

Keeping or Losing Tiny-Error Correctness of Cryptosystems Implemented by Secure Pseudorandom Generators. - Koji Nuida (IACR Cryptol. ePrint Arch., 2018)

Toward Finite-Runtime Card-Based Protocol for Generating a Hidden Random Permutation without Fixed Points. - Yuji Hashimoto; Koji Nuida; Kazumasa Shinagawa; Masaki Inamura; Goichiro Hanaoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Secure Grouping Protocol Using a Deck of Cards. - Yuji Hashimoto; Kazumasa Shinagawa; Koji Nuida; Masaki Inamura; Goichiro Hanaoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Privacy Preservation for Versatile Pay-TV Services. - Kazuto Ogawa; Koji Nuida (HCI (29), 2019)

Towards High-Throughput Secure MPC over the Internet: Communication-Efficient Two-Party Protocols and Its Application. - Satsuya Ohata; Koji Nuida (CoRR, 2019)

Arbitrary Univariate Function Evaluation and Re-Encryption Protocols over Lifted-ElGamal Type Ciphertexts. - Koji Nuida; Satsuya Ohata; Shigeo Mitsunari; Nuttapong Attrapadung (IACR Cryptol. ePrint Arch., 2019)

A Single Shuffle Is Enough for Secure Card-Based Computation of Any Circuit. - Kazumasa Shinagawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2019)

An Efficient Private Evaluation of a Decision Graph. - Hiroki Sudo; Koji Nuida; Kana Shimizu (IACR Cryptol. ePrint Arch., 2019)

Elliptic Curve Method Using Complex Multiplication Method. - Yusuke Aikawa; Koji Nuida; Masaaki Shirase (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Polynomial expressions of p-ary auction functions. - Shizuo Kaji; Toshiaki Maeno; Koji Nuida; Yasuhide Numata (J. Math. Cryptol., 2019)

Secure Wavelet Matrix: Alphabet-Friendly Privacy-Preserving String Search for Bioinformatics. - Hiroki Sudo; Masanobu Jimbo; Koji Nuida; Kana Shimizu (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Communication-Efficient (Client-Aided) Secure Two-Party Protocols and Its Application. - Satsuya Ohata; Koji Nuida (Financial Cryptography, 2020)

A Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures. - Reo Eriguchi; Noboru Kunihiro; Koji Nuida (ISITA, 2020)

Identity-Based Outsider Anonymous Broadcast Encryption with Simultaneous Individual Messaging. - Mriganka Mandal; Koji Nuida (NSS, 2020)

Short Lattice Signatures in the Standard Model with Efficient Tag Generation. - Kaisei Kajita; Kazuto Ogawa; Koji Nuida; Tsuyoshi Takagi (ProvSec, 2020)

An Elementary Linear-Algebraic Proof without Heavy Computation for the Group Law on Elliptic Curves. - Koji Nuida (CoRR, 2020)

Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications. - Hiraku Morita; Nuttapong Attrapadung; Tadanori Teruya; Satsuya Ohata; Koji Nuida; Goichiro Hanaoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks. - Keitaro Hiwatashi; Ken Ogura; Satsuya Ohata; Koji Nuida (AsiaCCS, 2021)

Improved Supersingularity Testing of Elliptic Curves Using Legendre Form. - Yuji Hashimoto; Koji Nuida (CASC, 2021)

Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions. - Reo Eriguchi; Kazuma Ohara; Shota Yamada 001; Koji Nuida (CRYPTO (2), 2021)

Efficient Noise Generation to Achieve Differential Privacy with Applications to Secure Multiparty Computation. - Reo Eriguchi; Atsunori Ichikawa; Noboru Kunihiro; Koji Nuida (Financial Cryptography (1), 2021)

Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security. - Mriganka Mandal; Ramprasad Sarkar; Junbeom Hur; Koji Nuida (ISPEC, 2021)

Cryptographic Pseudorandom Generators Can Make Cryptosystems Problematic. - Koji Nuida (Public Key Cryptography (2), 2021)

Halt Properties and Complexity Evaluations for Optimal DeepLLL Algorithm Families. - Takuto Odagawa; Koji Nuida (CoRR, 2021)

An Improvement of a Key Exchange Protocol Relying on Polynomial Maps. - Keita Suzuki; Koji Nuida (CoRR, 2021)

A single shuffle is enough for secure card-based computation of any Boolean circuit. - Kazumasa Shinagawa; Koji Nuida (Discret. Appl. Math., 2021)

Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-degree Polynomials. - Reo Eriguchi; Koji Nuida (IACR Cryptol. ePrint Arch., 2021)

Computational Irrelevancy: Bridging the Gap between Pseudo- and Real Randomness in MPC Protocols. - Nariyasu Heseri; Koji Nuida (IACR Cryptol. ePrint Arch., 2021)

Chosen Ciphertext Secure Keyed Two-Level Homomorphic Encryption. - Yusaku Maeda; Koji Nuida (IACR Cryptol. ePrint Arch., 2021)

How to Handle Invalid Queries for Malicious-Private Protocols Based on Homomorphic Encryption. - Koji Nuida (IACR Cryptol. ePrint Arch., 2021)

Card-based Cryptographic Protocols for Private Set Intersection. - Anastasiia Doi; Tomoki Ono; Takeshi Nakai; Kazumasa Shinagawa; Yohei Watanabe 001; Koji Nuida; Mitsugu Iwamoto (ISITA, 2022)

On Compression Functions over Small Groups with Applications to Cryptography. - Koji Nuida (CoRR, 2022)

Multi-Server PIR with Full Error Detection and Limited Error Correction. - Reo Eriguchi; Kaoru Kurosawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2022)

On the Optimal Communication Complexity of Error-Correcting Multi-Server PIR. - Reo Eriguchi; Kaoru Kurosawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2022)

Single-shuffle Full-open Card-based Protocols Imply Private Simultaneous Messages Protocols. - Kazumasa Shinagawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2022)

Tight Security of Twin-DH Hashed ElGamal KEM in Multi-User Setting. - Yuji Hashimoto; Koji Nuida; Goichiro Hanaoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

An Efficient Secure Division Protocol Using Approximate Multi-Bit Product and New Constant-Round Building Blocks. - Keitaro Hiwatashi; Satsuya Ohata; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing. - Kota Sasaki; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Explicit and Nearly Tight Lower Bound for 2-Party Perfectly Secure FSS. - Keitaro Hiwatashi; Koji Nuida (ACNS, 2023)

Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation. - Keitaro Hiwatashi; Koji Nuida (ITC, 2023)

Threshold Fully Homomorphic Encryption Over the Torus. - Yukimasa Sugizaki; Hikaru Tsuchida 001; Takuya Hayashi 001; Koji Nuida; Akira Nakashima; Toshiyuki Isshiki; Kengo Mori (ESORICS (1), 2023)

Uniform Cyclic Group Factorizations of Finite Groups. - Kazuki Kanai; Kengo Miyamoto; Koji Nuida; Kazumasa Shinagawa (CoRR, 2023)

New Generic Constructions of Error-Correcting PIR and Efficient Instantiations. - Reo Eriguchi; Kaoru Kurosawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2023)

Efficient Card-Based Millionaires' Protocols via Non-Binary Input Encoding. - Koji Nuida (IACR Cryptol. ePrint Arch., 2023)

Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions. - Kazumasa Shinagawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2023)

Efficient Noise Generation Protocols for Differentially Private Multiparty Computation. - Reo Eriguchi; Atsunori Ichikawa; Noboru Kunihiro; Koji Nuida (IEEE Trans. Dependable Secur. Comput., 2023)

Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures with Application to Symmetric PIR. - Reo Eriguchi; Noboru Kunihiro; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Short Lattice Signature Scheme with Tighter Reduction under Ring-SIS Assumption. - Kaisei Kajita; Go Ohtake; Kazuto Ogawa; Koji Nuida; Tsuyoshi Takagi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures. - Reo Eriguchi; Noboru Kunihiro; Koji Nuida (Des. Codes Cryptogr., 2023)

Efficient Supersingularity Testing of Elliptic Curves Using Legendre Curves. - Yuji Hashimoto; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Efficient Construction of CGL Hash Function Using Legendre Curves. - Yuji Hashimoto; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Private simultaneous messages based on quadratic residues. - Kazumasa Shinagawa; Reo Eriguchi; Shohei Satake; Koji Nuida (Des. Codes Cryptogr., 2023)

How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik's Cube. - Kazumasa Shinagawa; Kazuki Kanai; Kengo Miyamoto; Koji Nuida (FUN, 2024)

Multi-key Homomorphic Encryption with Threshold Re-encryption. - Akira Nakashima; Yukimasa Sugizaki; Hikaru Tsuchida 001; Takuya Hayashi 001; Koji Nuida; Kengo Mori; Toshiyuki Isshiki (SAC (1), 2024)

Parameterizing Time-Memory Trade-Off for Flexible Implementation of CRYSTALS-Dilithium. - Yasushi Takahashi; Naohisa Nishida; Yuji Unagami; Saburo Toyonaga; Naoto Yanai; Yasuhiko Ikematsu; Koji Nuida; Masaya Yasuda (SecITC, 2024)

Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search. - Reo Eriguchi; Kaoru Kurosawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2024)

Efficient theta-based algorithms for computing (ℓ, ℓ)-isogenies on Kummer surfaces for arbitrary odd ℓ. - Ryo Yoshizumi; Hiroshi Onuki; Ryo Ohashi; Momonari Kudo; Koji Nuida (IACR Cryptol. ePrint Arch., 2024)

Correlated Randomness Reduction in Domain-Restricted Secure Two-Party Computation. - Keitaro Hiwatashi; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

On Weighted-Sum Orthogonal Latin Squares and Secret Sharing. - Koji Nuida; Tomoko Adachi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption. - Hirotomo Shinoki; Koji Nuida (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

Card-Based Protocols for Private Set Intersection and Union. - Anastasiia Doi; Tomoki Ono; Yoshiki Abe; Takeshi Nakai; Kazumasa Shinagawa; Yohei Watanabe 001; Koji Nuida; Mitsugu Iwamoto (New Gener. Comput., 2024)

Card-Based Protocols Imply PSM Protocols. - Kazumasa Shinagawa; Koji Nuida (STACS, 2025)

List Decoding in Private Information Retrieval: Formal Definition and Efficient Constructions. - Reo Eriguchi; Kaoru Kurosawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2025)

Card-Based Protocol Counting Connected Components of Graphs. - Koji Nuida (IACR Cryptol. ePrint Arch., 2025)

Improved Private Simultaneous Messages Protocols for Symmetric Functions with Universal Reconstruction. - Koji Nuida (IACR Cryptol. ePrint Arch., 2025)

A Note on Single-Cut Full-Open Protocols. - Kazumasa Shinagawa; Koji Nuida (CoRR, 2025)

Cyclic Equalizability of Words and Its Application to Card-Based Cryptography. - Kazumasa Shinagawa; Koji Nuida (CoRR, 2025)