Akinori Kawachi

According to our database, Akinori Kawachi authored at least 41 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher.

Akinori Kawachi, Yuki Naito

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021

Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets.

Akinori Kawachi, Maki Yoshida

IACR Cryptol. ePrint Arch., 2021

Communication Complexity of Private simultaneous Quantum Messages Protocols.

Akinori Kawachi, Harumichi Nishimura

IACR Cryptol. ePrint Arch., 2021

Recent Progress in Private Simultaneous Messages Protocols.

Akinori Kawachi

Proceedings of the IEEE Information Theory Workshop, 2021

2020

Foreword.

Akinori Kawachi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Hamming Weight of Product of Random Sparse Polynomials.

Akinori Kawachi

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Secure Primitive for Big Data Utilization.

Akinori Kawachi, Atsuko Miyaji, Kazuhisa Nakasho, Yiying Qi, Yuuki Takano

Proceedings of the Security Infrastructure Technology for Integrated Utilization of Big Data, 2020

2019

Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs.

Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa

Theor. Comput. Sci., 2019

Quantum Query Complexity of Unitary Operator Discrimination.

Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki

IEICE Trans. Inf. Syst., 2019

String commitment scheme with low output locality.

Hideaki Miyaji, Akinori Kawachi, Atsuko Miyaji

Proceedings of the 14th Asia Joint Conference on Information Security, 2019

2018

Circuit lower bounds from learning-theoretic approaches.

Akinori Kawachi

Theor. Comput. Sci., 2018

2017

The Query Complexity of Witness Finding.

Akinori Kawachi, Benjamin Rossman, Osamu Watanabe

Theory Comput. Syst., 2017

Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems.

Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes.

Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka

Proceedings of the Advances in Information and Computer Security, 2016

2015

A Fourier-Analytic Approach to List-Decoding for Sparse Random Linear Codes.

Akinori Kawachi, Ikko Yamane

IEICE Trans. Inf. Syst., 2015

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

2013

Hard Functions for Low-Degree Polynomials over Prime Fields.

Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka

ACM Trans. Comput. Theory, 2013

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction.

Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga

IACR Cryptol. ePrint Arch., 2013

2012

Computational Indistinguishability Between Quantum States and Its Cryptographic Application.

Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami

J. Cryptol., 2012

Estimating the Gowers Norm of Modulo Functions over Prime Fields.

Akinori Kawachi, Hidetoki Tanaka, Osamu Watanabe

IEICE Trans. Inf. Syst., 2012

Query Complexity and Error Tolerance of Witness Finding Algorithms.

Akinori Kawachi, Benjamin Rossman, Osamu Watanabe

Electron. Colloquium Comput. Complex., 2012

Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability.

Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka

Proceedings of the Advances in Information and Computer Security, 2012

2011

Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity.

Akinori Kawachi, Christopher Portmann, Keisuke Tanaka

IACR Cryptol. ePrint Arch., 2011

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.

Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi

Comput. Complex., 2011

2010

Security of Encryption Schemes in Weakened Random Oracle Models.

Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa

IACR Cryptol. ePrint Arch., 2010

2009

Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems.

Akinori Kawachi, Osamu Watanabe

Electron. Colloquium Comput. Complex., 2009

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.

Dan Gutfreund, Akinori Kawachi

Electron. Colloquium Comput. Complex., 2009

2008

Quantum measurements for hidden subgroup problems with optimal sample complexity.

Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi

Quantum Inf. Comput., 2008

On the Power of Quantum Encryption Keys.

Akinori Kawachi, Christopher Portmann

Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.

Akinori Kawachi, Keisuke Tanaka, Keita Xagawa

Proceedings of the Advances in Cryptology, 2008

2007

Improved algorithms for quantum identification of Boolean oracles.

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

Theor. Comput. Sci., 2007

Multi-bit Cryptosystems Based on Lattice Problems.

Akinori Kawachi, Keisuke Tanaka, Keita Xagawa

Proceedings of the Public Key Cryptography, 2007

2006

Progress in Quantum Computational Cryptography.

Akinori Kawachi, Takeshi Koshiba

J. Univers. Comput. Sci., 2006

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.

Akinori Kawachi, Tomoyuki Yamakami

Electron. Colloquium Comput. Complex., 2006

2005

Universal test for quantum one-way permutations.

Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra

Theor. Comput. Sci., 2005

Quantum Sampling for Balanced Allocations.

Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita

IEICE Trans. Inf. Syst., 2005

Compact Routing with Stretch Factor of Less Than Three.

Kazuo Iwama, Akinori Kawachi

IEICE Trans. Inf. Syst., 2005

2004

Quantum Identification of Boolean Oracles.

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita

Proceedings of the STACS 2004, 2004

Approximated Two Choices in Randomized Load Balancing.

Kazuo Iwama, Akinori Kawachi

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

A New Quantum Claw-finding Algorithm for Three Functions.

Kazuo Iwama, Akinori Kawachi

New Gener. Comput., 2003

2000

Compact routing with stretch factor of less than three (brief announcement).

Kazuo Iwama, Akinori Kawachi

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000