Compact routing with stretch factor of less than three (brief announcement). - Kazuo Iwama; Akinori Kawachi (PODC, 2000)

A New Quantum Claw-finding Algorithm for Three Functions. - Kazuo Iwama; Akinori Kawachi (New Gener. Comput., 2003)

Approximated Two Choices in Randomized Load Balancing. - Kazuo Iwama; Akinori Kawachi (ISAAC, 2004)

Quantum Identification of Boolean Oracles. - Andris Ambainis; Kazuo Iwama; Akinori Kawachi; Hiroyuki Masuda; Raymond H. Putra; Shigeru Yamashita (STACS, 2004)

Compact Routing with Stretch Factor of Less Than Three. - Kazuo Iwama; Akinori Kawachi (IEICE Trans. Inf. Syst., 2005)

Quantum Sampling for Balanced Allocations. - Kazuo Iwama; Akinori Kawachi; Shigeru Yamashita (IEICE Trans. Inf. Syst., 2005)

Universal test for quantum one-way permutations. - Akinori Kawachi; Hirotada Kobayashi; Takeshi Koshiba; Raymond H. Putra (Theor. Comput. Sci., 2005)

Quantum Biased Oracles. - Kazuo Iwama; Akinori Kawachi; Shigeru Yamashita (Inf. Media Technol., 2006)

Progress in Quantum Computational Cryptography. - Akinori Kawachi; Takeshi Koshiba (J. Univers. Comput. Sci., 2006)

Multi-bit Cryptosystems Based on Lattice Problems. - Akinori Kawachi; Keisuke Tanaka; Keita Xagawa (Public Key Cryptography, 2007)

Improved algorithms for quantum identification of Boolean oracles. - Andris Ambainis; Kazuo Iwama; Akinori Kawachi; Rudy Raymond; Shigeru Yamashita (Theor. Comput. Sci., 2007)

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. - Akinori Kawachi; Keisuke Tanaka; Keita Xagawa (ASIACRYPT, 2008)

On the Power of Quantum Encryption Keys. - Akinori Kawachi; Christopher Portmann (PQCrypto, 2008)

Quantum measurements for hidden subgroup problems with optimal sample complexity. - Masahito Hayashi; Akinori Kawachi; Hirotada Kobayashi (Quantum Inf. Comput., 2008)

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. - Dan Gutfreund; Akinori Kawachi (Electron. Colloquium Comput. Complex., 2009)

Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems. - Akinori Kawachi; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2009)

Security of Encryption Schemes in Weakened Random Oracle Models. - Akinori Kawachi; Akira Numayama; Keisuke Tanaka; Keita Xagawa (IACR Cryptol. ePrint Arch., 2010)

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. - Akinori Kawachi; Tomoyuki Yamakami (SIAM J. Comput., 2010)

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. - Baris Aydinlioglu; Dan Gutfreund; John M. Hitchcock; Akinori Kawachi (Comput. Complex., 2011)

Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. - Akinori Kawachi; Christopher Portmann; Keisuke Tanaka (IACR Cryptol. ePrint Arch., 2011)

Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability. - Akinori Kawachi; Hirotoshi Takebe; Keisuke Tanaka (IWSEC, 2012)

Query Complexity and Error Tolerance of Witness Finding Algorithms. - Akinori Kawachi; Benjamin Rossman; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2012)

Estimating the Gowers Norm of Modulo Functions over Prime Fields. - Akinori Kawachi; Hidetoki Tanaka; Osamu Watanabe 001 (IEICE Trans. Inf. Syst., 2012)

Computational Indistinguishability Between Quantum States and Its Cryptographic Application. - Akinori Kawachi; Takeshi Koshiba; Harumichi Nishimura; Tomoyuki Yamakami (J. Cryptol., 2012)

Hard Functions for Low-Degree Polynomials over Prime Fields. - Andrej Bogdanov; Akinori Kawachi; Hidetoki Tanaka (ACM Trans. Comput. Theory, 2013)

Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model. - Eiichiro Fujisaki; Akinori Kawachi; Ryo Nishimaki; Keisuke Tanaka; Kenji Yasunaga (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

A Fourier-Analytic Approach to List-Decoding for Sparse Random Linear Codes. - Akinori Kawachi; Ikko Yamane (IEICE Trans. Inf. Syst., 2015)

Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes. - Akinori Kawachi; Hirotoshi Takebe; Keisuke Tanaka (IWSEC, 2016)

Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. - Akinori Kawachi; Mitsunori Ogihara; Kei Uchizawa (MFCS, 2017)

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. - Akinori Kawachi; Yoshio Okamoto; Keisuke Tanaka; Kenji Yasunaga (Comput. J., 2017)

The Query Complexity of Witness Finding. - Akinori Kawachi; Benjamin Rossman; Osamu Watanabe 001 (Theory Comput. Syst., 2017)

Circuit lower bounds from learning-theoretic approaches. - Akinori Kawachi (Theor. Comput. Sci., 2018)

String commitment scheme with low output locality. - Hideaki Miyaji; Akinori Kawachi; Atsuko Miyaji (AsiaJCIS, 2019)

Quantum Query Complexity of Unitary Operator Discrimination. - Akinori Kawachi; Kenichi Kawano; Francois Le Gall; Suguru Tamaki (IEICE Trans. Inf. Syst., 2019)

Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. - Akinori Kawachi; Mitsunori Ogihara; Kei Uchizawa (Theor. Comput. Sci., 2019)

Secure Primitive for Big Data Utilization. - Akinori Kawachi; Atsuko Miyaji; Kazuhisa Nakasho; Yiying Qi; Yuuki Takano (Security Infrastructure Technology for Integrated Utilization of Big Data, 2020)

Hamming Weight of Product of Random Sparse Polynomials. - Akinori Kawachi (ISITA, 2020)

Foreword. - Akinori Kawachi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Recent Progress in Private Simultaneous Messages Protocols. - Akinori Kawachi (ITW, 2021)

Communication Complexity of Private simultaneous Quantum Messages Protocols. - Akinori Kawachi; Harumichi Nishimura (IACR Cryptol. ePrint Arch., 2021)

Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets. - Akinori Kawachi; Maki Yoshida (IACR Cryptol. ePrint Arch., 2021)

Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. - Akinori Kawachi; Yuki Naito (COCOON (2), 2023)

A Threshold-Blind Signature Scheme and Its Application in Blockchain-Based Systems. - Víctor Gabriel Reyes Macedo; Akinori Kawachi; Gina Gallegos-García; Moisés Salinas-Rosales (IEEE Access, 2024)