Akinori Kawachi

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 18

Top Topics

Query Complexity

Messages Exchanged

Top Venues

Theor. Comput. Sci.

IEICE Trans. Inf. Syst.

IACR Cryptol. ePrint Arch.

Publications

Akinori Kawachi, Yuki Naito
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. CoRR (2023)
Akinori Kawachi, Yuki Naito
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. COCOON (2) (2023)
Akinori Kawachi, Harumichi Nishimura
Communication Complexity of Private Simultaneous Quantum Messages Protocols. CoRR (2021)
Akinori Kawachi, Harumichi Nishimura
Communication Complexity of Private simultaneous Quantum Messages Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Akinori Kawachi, Harumichi Nishimura
Communication Complexity of Private Simultaneous Quantum Messages Protocols. ITC (2021)
Akinori Kawachi, Maki Yoshida
Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2021 (2021)
Akinori Kawachi
Recent Progress in Private Simultaneous Messages Protocols. ITW (2021)
Akinori Kawachi
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Akinori Kawachi
Hamming Weight of Product of Random Sparse Polynomials. ISITA (2020)
Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki
Quantum Query Complexity of Unitary Operator Discrimination. IEICE Trans. Inf. Syst. (3) (2019)
Hideaki Miyaji, Akinori Kawachi, Atsuko Miyaji
String commitment scheme with low output locality. AsiaJCIS (2019)
Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. Theor. Comput. Sci. 762 (2019)
Akinori Kawachi
Circuit lower bounds from learning-theoretic approaches. Theor. Comput. Sci. 733 (2018)
Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. Comput. J. 60 (5) (2017)
Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki
Quantum Query Complexity of Unitary Operator Discrimination. COCOON (2017)
Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
The Query Complexity of Witness Finding. Theory Comput. Syst. 61 (2) (2017)
Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. MFCS (2017)
Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka
Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes. IWSEC (2016)
Akinori Kawachi, Ikko Yamane
A Fourier-Analytic Approach to List-Decoding for Sparse Random Linear Codes. IEICE Trans. Inf. Syst. (3) (2015)
Eiichiro Fujisaki, Akinori Kawachi, Ryo Nishimaki, Keisuke Tanaka, Kenji Yasunaga
Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (3) (2015)
Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
The Query Complexity of Witness Finding. CSR (2014)
Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka
Hard Functions for Low-Degree Polynomials over Prime Fields. ACM Trans. Comput. Theory 5 (2) (2013)
Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. IACR Cryptol. ePrint Arch. 2013 (2013)
Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka
Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability. IWSEC (2012)
Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
Query Complexity and Error Tolerance of Witness Finding Algorithms. Electron. Colloquium Comput. Complex. 19 (2012)
Akinori Kawachi, Hidetoki Tanaka, Osamu Watanabe
Estimating the Gowers Norm of Modulo Functions over Prime Fields. IEICE Trans. Inf. Syst. (3) (2012)
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptol. 25 (3) (2012)
Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Comput. Complex. 20 (2) (2011)
Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka
Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS (2011)
Akinori Kawachi, Christopher Portmann, Keisuke Tanaka
Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. IACR Cryptol. ePrint Arch. 2011 (2011)
Akinori Kawachi, Christopher Portmann, Keisuke Tanaka
Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity. ICITS (2011)
Akinori Kawachi, Tomoyuki Yamakami
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. SIAM J. Comput. 39 (7) (2010)
Dan Gutfreund, Akinori Kawachi
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Computational Complexity Conference (2010)
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa
Security of Encryption Schemes in Weakened Random Oracle Models. Public Key Cryptography (2010)
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa
Security of Encryption Schemes in Weakened Random Oracle Models. IACR Cryptol. ePrint Arch. 2010 (2010)
Dan Gutfreund, Akinori Kawachi
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electron. Colloquium Comput. Complex. 16 (2009)
Akinori Kawachi, Osamu Watanabe
Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems. Electron. Colloquium Comput. Complex. 16 (2009)
Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi
Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Inf. Comput. 8 (3) (2008)
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. ASIACRYPT (2008)
Akinori Kawachi, Christopher Portmann
On the Power of Quantum Encryption Keys. PQCrypto (2008)
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
Multi-bit Cryptosystems Based on Lattice Problems. Public Key Cryptography (2007)
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita
Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378 (1) (2007)
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita
Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT (2006)
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
Quantum Biased Oracles. Inf. Media Technol. 1 (1) (2006)
Akinori Kawachi, Takeshi Koshiba
Progress in Quantum Computational Cryptography. J. Univers. Comput. Sci. 12 (6) (2006)
Akinori Kawachi, Tomoyuki Yamakami
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding CoRR (2006)
Akinori Kawachi, Tomoyuki Yamakami
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. Electron. Colloquium Comput. Complex. 13 (020) (2006)
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptol. ePrint Arch. 2006 (2006)
Akinori Kawachi, Tomoyuki Yamakami
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. ICALP (2) (2006)
Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
Universal test for quantum one-way permutations. Theor. Comput. Sci. 345 (2-3) (2005)
Kazuo Iwama, Akinori Kawachi
Compact Routing with Stretch Factor of Less Than Three. IEICE Trans. Inf. Syst. (1) (2005)
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
Quantum Sampling for Balanced Allocations. IEICE Trans. Inf. Syst. (1) (2005)
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT (2005)
Kazuo Iwama, Akinori Kawachi
Approximated Two Choices in Randomized Load Balancing. ISAAC (2004)
Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
Universal Test for Quantum One-Way Permutations. MFCS (2004)
Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita
Quantum Identification of Boolean Oracles. STACS (2004)
Kazuo Iwama, Akinori Kawachi
A New Quantum Claw-finding Algorithm for Three Functions. New Gener. Comput. 21 (4) (2003)
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
Quantum Sampling for Balanced Allocations. COCOON (2003)
Kazuo Iwama, Akinori Kawachi
Compact routing with stretch factor of less than three (brief announcement). PODC (2000)