| Concurrently secure identification schemes based on the worst-case hardness of lattice problems A Kawachi, K Tanaka, K Xagawa International Conference on the Theory and Application of Cryptology and …, 2008 | 204 | 2008 |
| Multi-bit cryptosystems based on lattice problems A Kawachi, K Tanaka, K Xagawa International Workshop on Public Key Cryptography, 315-329, 2007 | 125 | 2007 |
| Computational indistinguishability between quantum states and its cryptographic application A Kawachi, T Koshiba, H Nishimura, T Yamakami Annual International Conference on the Theory and Applications of …, 2005 | 74* | 2005 |
| Introduction to quantum information science M Hayashi, S Ishizaka, A Kawachi, G Kimura, T Ogawa Springer, 2014 | 65 | 2014 |
| Quantum identification of Boolean oracles A Ambainis, K Iwama, A Kawachi, H Masuda, RH Putra, S Yamashita Annual Symposium on Theoretical Aspects of Computer Science, 105-116, 2004 | 52 | 2004 |
| Quantum measurements for hidden subgroup problems with optimal sample complexity M Hayashi, A Kawachi, H Kobayashi arXiv preprint quant-ph/0604174, 2006 | 49 | 2006 |
| Robust quantum algorithms for oracle identification A Ambainis, K Iwama, A Kawachi, R Raymond, S Yamashita arXiv preprint quant-ph/0411204, 2004 | 20 | 2004 |
| Improved algorithms for quantum identification of Boolean oracles A Ambainis, K Iwama, A Kawachi, R Raymond, S Yamashita Theoretical computer science 378 (1), 41-53, 2007 | 19 | 2007 |
| Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds B Aydınlıog̃lu, D Gutfreund, JM Hitchcock, A Kawachi computational complexity 20 (2), 329-366, 2011 | 17 | 2011 |
| General constructions of rational secret sharing with expected constant-round reconstruction A Kawachi, Y Okamoto, K Tanaka, K Yasunaga The Computer Journal 60 (5), 711-728, 2017 | 13 | 2017 |
| Universal test for quantum one-way permutations A Kawachi, H Kobayashi, T Koshiba, RH Putra Theoretical computer science 345 (2-3), 370-385, 2005 | 12 | 2005 |
| Quantum hardcore functions by complexity-theoretical quantum list decoding A Kawachi, T Yamakami International Colloquium on Automata, Languages, and Programming, 216-227, 2006 | 11 | 2006 |
| Compact routing with stretch factor of less than three (brief announcement) K Iwama, A Kawachi Proceedings of the nineteenth annual ACM symposium on Principles of …, 2000 | 11 | 2000 |
| Generalized predecessor existence problems for boolean finite dynamical systems on directed graphs A Kawachi, M Ogihara, K Uchizawa Theoretical Computer Science 762, 25-40, 2019 | 10 | 2019 |
| On the power of quantum encryption keys A Kawachi, C Portmann International Workshop on Post-Quantum Cryptography, 165-180, 2008 | 10 | 2008 |
| Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity A Kawachi, C Portmann, K Tanaka International Conference on Information Theoretic Security, 6-24, 2011 | 9 | 2011 |
| Generalized predecessor existence problems for boolean finite dynamical systems A Kawachi, M Ogihara, K Uchizawa 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017 | 8 | 2017 |
| Security of encryption schemes in weakened random oracle models A Kawachi, A Numayama, K Tanaka, K Xagawa International Workshop on Public Key Cryptography, 403-419, 2010 | 7 | 2010 |
| Approximated two choices in randomized load balancing K Iwama, A Kawachi International Symposium on Algorithms and Computation, 545-557, 2004 | 7 | 2004 |
| Quantum query complexity of unitary operator discrimination A Kawachi, K Kawano, F Le Gall, S Tamaki IEICE TRANSACTIONS on Information and Systems 102 (3), 483-491, 2019 | 5 | 2019 |
Shigeru YamashitaRitsumeikan UniversityVerified email at cs.ritsumei.ac.jp
