Koji Nuida
Orcid: 0000-0001-8259-9958
According to our database1,
Koji Nuida
authored at least 101 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
New Gener. Comput., September, 2024
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024
Efficient theta-based algorithms for computing (ℓ, ℓ)-isogenies on Kummer surfaces for arbitrary odd ℓ.
IACR Cryptol. ePrint Arch., 2024
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search.
IACR Cryptol. ePrint Arch., 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
2023
Des. Codes Cryptogr., December, 2023
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2023
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2023
Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures.
Des. Codes Cryptogr., May, 2023
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023
Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures with Application to Symmetric PIR.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023
Efficient Noise Generation Protocols for Differentially Private Multiparty Computation.
IEEE Trans. Dependable Secur. Comput., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the Computer Security - ESORICS 2023, 2023
Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation.
Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023
Proceedings of the Applied Cryptography and Network Security, 2023
2022
Efficiency and Accuracy Improvements of Secure Floating-Point Addition over Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022
An Efficient Secure Division Protocol Using Approximate Multi-Bit Product and New Constant-Round Building Blocks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022
Single-shuffle Full-open Card-based Protocols Imply Private Simultaneous Messages Protocols.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
CoRR, 2022
Proceedings of the International Symposium on Information Theory and Its Applications, 2022
2021
How to Handle Invalid Queries for Malicious-Private Protocols Based on Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Computational Irrelevancy: Bridging the Gap between Pseudo- and Real Randomness in MPC Protocols.
IACR Cryptol. ePrint Arch., 2021
Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-degree Polynomials.
IACR Cryptol. ePrint Arch., 2021
Discret. Appl. Math., 2021
CoRR, 2021
Proceedings of the Public-Key Cryptography - PKC 2021, 2021
Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security.
Proceedings of the Information Security Practice and Experience: 16th International Conference, 2021
Efficient Noise Generation to Achieve Differential Privacy with Applications to Secure Multiparty Computation.
Proceedings of the Financial Cryptography and Data Security, 2021
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021
Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks.
Proceedings of the ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, 2021
2020
Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020
An Elementary Linear-Algebraic Proof without Heavy Computation for the Group Law on Elliptic Curves.
CoRR, 2020
Proceedings of the Provable and Practical Security - 14th International Conference, ProvSec 2020, Singapore, November 29, 2020
Identity-Based Outsider Anonymous Broadcast Encryption with Simultaneous Individual Messaging.
Proceedings of the Network and System Security - 14th International Conference, 2020
A Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020
Communication-Efficient (Client-Aided) Secure Two-Party Protocols and Its Application.
Proceedings of the Financial Cryptography and Data Security, 2020
2019
Secure Wavelet Matrix: Alphabet-Friendly Privacy-Preserving String Search for Bioinformatics.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Arbitrary Univariate Function Evaluation and Re-Encryption Protocols over Lifted-ElGamal Type Ciphertexts.
IACR Cryptol. ePrint Arch., 2019
Towards High-Throughput Secure MPC over the Internet: Communication-Efficient Two-Party Protocols and Its Application.
CoRR, 2019
Proceedings of the HCI for Cybersecurity, Privacy and Trust, 2019
2018
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
Toward Finite-Runtime Card-Based Protocol for Generating a Hidden Random Permutation without Fixed Points.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
Keeping or Losing Tiny-Error Correctness of Cryptosystems Implemented by Secure Pseudorandom Generators.
IACR Cryptol. ePrint Arch., 2018
Des. Codes Cryptogr., 2018
Proceedings of the International Symposium on Information Theory and Its Applications, 2018
Proceedings of the International Symposium on Information Theory and Its Applications, 2018
Proceedings of the Computer Security, 2018
2017
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017
A Public-key Encryption Scheme Based on Non-linear Indeterminate Equations (Giophantus).
IACR Cryptol. ePrint Arch., 2017
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017
Correction of a Secure Comparison Protocol for Encrypted Integers in IEEE WIFS 2012 (Short Paper).
Proceedings of the Advances in Information and Computer Security, 2017
2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
Bioinform., 2016
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016
2015
BMC Bioinform., December, 2015
A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators.
Int. J. Found. Comput. Sci., 2015
Proceedings of the Provable Security, 2015
On Limitations and Alternatives of Privacy-Preserving Cryptographic Protocols for Genomic Data.
Proceedings of the Advances in Information and Computer Security, 2015
Proceedings of the Advances in Information and Computer Security, 2015
2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Tree-Structured Composition of Homomorphic Encryption: How to Weaken Underlying Assumptions.
IACR Cryptol. ePrint Arch., 2014
A Simple Framework for Noise-Free Construction of Fully Homomorphic Encryption from a Special Class of Non-Commutative Groups.
IACR Cryptol. ePrint Arch., 2014
Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014
Proceedings of the Provable Security - 8th International Conference, 2014
2013
IEEE Trans. Inf. Theory, 2013
IACR Cryptol. ePrint Arch., 2013
2012
On pseudorandomization of information-theoretically secure schemes without hardness assumptions.
IACR Cryptol. ePrint Arch., 2012
2010
Pattern Occurrence in the Dyadic Expansion of Square Root of Two and an Analysis of Pseudorandom Number Generators.
Integers, 2010
IACR Cryptol. ePrint Arch., 2010
Discret. Math., 2010
2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
IACR Cryptol. ePrint Arch., 2009
An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation.
Proceedings of the Advances in Information and Computer Security, 2009
Proceedings of the Information Hiding, 11th International Workshop, 2009
An Improvement of Pseudorandomization against Unbounded Attack Algorithms - The Case of Fingerprint Codes.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009
A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009
2007
Proceedings of the Information Hiding, 9th International Workshop, 2007
A Tracing Algorithm for Short 2-Secure Probabilistic Fingerprinting Codes Strongly Protecting Innocent Users.
Proceedings of the 4th IEEE Consumer Communications and Networking Conference, 2007
An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths.
Proceedings of the Applied Algebra, 2007
2006
Optimal probabilistic fingerprinting codes using optimal finite random variables related to numerical quadrature
CoRR, 2006