Akinori Kawachi
Akinori Kawachi
Verified email at cs.info.mie-u.ac.jp - Homepage
TitleCited byYear
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
1412008
Multi-bit cryptosystems based on lattice problems
A Kawachi, K Tanaka, K Xagawa
International Workshop on Public Key Cryptography, 315-329, 2007
1012007
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
64*2005
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
472004
Quantum measurements for hidden subgroup problems with optimal sample complexity
M Hayashi, A Kawachi, H Kobayashi
arXiv preprint quant-ph/0604174, 2006
422006
Quantum computation and information: from theory to experiment
H Imai, M Hayashi
Springer Science & Business Media, 2008
412008
Introduction to quantum information science
M Hayashi, S Ishizaka, A Kawachi, G Kimura, T Ogawa
Springer, 2014
382014
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
172007
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
132000
Universal test for quantum one-way permutations
A Kawachi, H Kobayashi, T Koshiba, RH Putra
Theoretical computer science 345 (2-3), 370-385, 2005
122005
Robust quantum algorithms for oracle identification
K Iwama, R Raymond, A Kawachi, S Yamashita
122004
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
112011
On the power of quantum encryption keys
A Kawachi, C Portmann
International Workshop on Post-Quantum Cryptography, 165-180, 2008
102008
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
92011
Quantum hardcore functions by complexity-theoretical quantum list decoding
A Kawachi, T Yamakami
International Colloquium on Automata, Languages, and Programming, 216-227, 2006
82006
Robust quantum algorithms for oracle identification
A Ambainis, K Iwama, A Kawachi, R Raymond, S Yamashita
arXiv preprint quant-ph/0411204, 2004
72004
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
62017
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
62010
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
D Gutfreund, A Kawachi
2010 IEEE 25th Annual Conference on Computational Complexity, 38-49, 2010
52010
The query complexity of witness finding
A Kawachi, B Rossman, O Watanabe
Theory of Computing Systems 61 (2), 305-321, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20