 | 2012 |
| 34 |  | Akinori Kawachi,
Benjamin Rossman,
Osamu Watanabe:
Query Complexity and Error Tolerance of Witness Finding Algorithms.
Electronic Colloquium on Computational Complexity (ECCC) 19: 2 (2012) |
| 33 |  | Akinori Kawachi,
Hidetoki Tanaka,
Osamu Watanabe:
Estimating the Gowers Norm of Modulo Functions over Prime Fields.
IEICE Transactions 95-D(3): 755-762 (2012) |
| 32 |  | Akinori Kawachi,
Takeshi Koshiba,
Harumichi Nishimura,
Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
J. Cryptology 25(3): 528-555 (2012) |
| 2011 |
| 31 |  | Akinori Kawachi,
Christopher Portmann,
Keisuke Tanaka:
Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity.
ICITS 2011: 6-24 |
| 30 |  | Andrej Bogdanov,
Akinori Kawachi,
Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields.
MFCS 2011: 120-131 |
| 29 |  | Baris Aydinlioglu,
Dan Gutfreund,
John M. Hitchcock,
Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Computational Complexity 20(2): 329-366 (2011) |
| 28 |  | Akinori Kawachi,
Christopher Portmann,
Keisuke Tanaka:
Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity.
IACR Cryptology ePrint Archive 2011: 92 (2011) |
| 2010 |
| 27 |  | Dan Gutfreund,
Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
IEEE Conference on Computational Complexity 2010: 38-49 |
| 26 |  | Akinori Kawachi,
Akira Numayama,
Keisuke Tanaka,
Keita Xagawa:
Security of Encryption Schemes in Weakened Random Oracle Models.
Public Key Cryptography 2010: 403-419 |
| 25 |  | Akinori Kawachi,
Akira Numayama,
Keisuke Tanaka,
Keita Xagawa:
Security of Encryption Schemes in Weakened Random Oracle Models.
IACR Cryptology ePrint Archive 2010: 122 (2010) |
| 24 |  | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.
SIAM J. Comput. 39(7): 2941-2969 (2010) |
| 2009 |
| 23 |  | Dan Gutfreund,
Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Electronic Colloquium on Computational Complexity (ECCC) 16: 146 (2009) |
| 22 |  | Akinori Kawachi,
Osamu Watanabe:
Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems.
Electronic Colloquium on Computational Complexity (ECCC) 16: 23 (2009) |
| 2008 |
| 21 |  | Akinori Kawachi,
Keisuke Tanaka,
Keita Xagawa:
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.
ASIACRYPT 2008: 372-389 |
| 20 |  | Akinori Kawachi,
Christopher Portmann:
On the Power of Quantum Encryption Keys.
PQCrypto 2008: 165-180 |
| 19 |  | Masahito Hayashi,
Akinori Kawachi,
Hirotada Kobayashi:
Quantum measurements for hidden subgroup problems with optimal sample complexity.
Quantum Information & Computation 8(3): 345-358 (2008) |
| 2007 |
| 18 |  | Akinori Kawachi,
Keisuke Tanaka,
Keita Xagawa:
Multi-bit Cryptosystems Based on Lattice Problems.
Public Key Cryptography 2007: 315-329 |
| 17 |  | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Rudy Raymond,
Shigeru Yamashita:
Improved algorithms for quantum identification of Boolean oracles.
Theor. Comput. Sci. 378(1): 41-53 (2007) |
| 2006 |
| 16 |  | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.
ICALP (2) 2006: 216-227 |
| 15 |  | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Rudy Raymond Harry Putra,
Shigeru Yamashita:
Improved Algorithms for Quantum Identification of Boolean Oracles.
SWAT 2006: 280-291 |
| 14 |  | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
CoRR abs/quant-ph/0602088: (2006) |
| 13 |  | Akinori Kawachi,
Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.
Electronic Colloquium on Computational Complexity (ECCC) 13(020): (2006) |
| 12 |  | Akinori Kawachi,
Takeshi Koshiba,
Harumichi Nishimura,
Tomoyuki Yamakami:
Computational Indistinguishability between Quantum States and Its Cryptographic Application.
IACR Cryptology ePrint Archive 2006: 148 (2006) |
| 11 |  | Akinori Kawachi,
Takeshi Koshiba:
Progress in Quantum Computational Cryptography.
J. UCS 12(6): 691-709 (2006) |
| 2005 |
| 10 |  | Akinori Kawachi,
Takeshi Koshiba,
Harumichi Nishimura,
Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
EUROCRYPT 2005: 268-284 |
| 9 |  | Kazuo Iwama,
Akinori Kawachi,
Shigeru Yamashita:
Quantum Sampling for Balanced Allocations.
IEICE Transactions 88-D(1): 39-46 (2005) |
| 8 |  | Kazuo Iwama,
Akinori Kawachi:
Compact Routing with Stretch Factor of Less Than Three.
IEICE Transactions 88-D(1): 47-52 (2005) |
| 7 |  | Akinori Kawachi,
Hirotada Kobayashi,
Takeshi Koshiba,
Raymond H. Putra:
Universal test for quantum one-way permutations.
Theor. Comput. Sci. 345(2-3): 370-385 (2005) |
| 2004 |
| 6 |  | Kazuo Iwama,
Akinori Kawachi:
Approximated Two Choices in Randomized Load Balancing.
ISAAC 2004: 545-557 |
| 5 |  | Akinori Kawachi,
Hirotada Kobayashi,
Takeshi Koshiba,
Raymond H. Putra:
Universal Test for Quantum One-Way Permutations.
MFCS 2004: 839-850 |
| 4 |  | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Hiroyuki Masuda,
Raymond H. Putra,
Shigeru Yamashita:
Quantum Identification of Boolean Oracles.
STACS 2004: 105-116 |
| 2003 |
| 3 |  | Kazuo Iwama,
Akinori Kawachi,
Shigeru Yamashita:
Quantum Sampling for Balanced Allocations.
COCOON 2003: 304-318 |
| 2 |  | Kazuo Iwama,
Akinori Kawachi:
A New Quantum Claw-finding Algorithm for Three Functions.
New Generation Comput. 21(4): 319-327 (2003) |
| 2000 |
| 1 |  | Kazuo Iwama,
Akinori Kawachi:
Compact routing with stretch factor of less than three (brief announcement).
PODC 2000: 337 |