Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Akinori Kawachi
2010 – today
- 2012
[j11]Akinori Kawachi, Hidetoki Tanaka, Osamu Watanabe: Estimating the Gowers Norm of Modulo Functions over Prime Fields. IEICE Transactions 95-D(3): 755-762 (2012)- [j10]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptology 25(3): 528-555 (2012)
- [c16]Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka: Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability. IWSEC 2012: 123-137
- [i8]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe: Query Complexity and Error Tolerance of Witness Finding Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 19: 2 (2012)
- 2011
- [j9]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)
- [c15]Akinori Kawachi, Christopher Portmann, Keisuke Tanaka: Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity. ICITS 2011: 6-24
- [c14]Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka: Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS 2011: 120-131
- [i7]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
- [j8]Akinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. SIAM J. Comput. 39(7): 2941-2969 (2010)
- [c13]Dan Gutfreund, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. IEEE Conference on Computational Complexity 2010: 38-49
- [c12]Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. Public Key Cryptography 2010: 403-419
- [i6]Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. IACR Cryptology ePrint Archive 2010: 122 (2010)
2000 – 2009
- 2009
- [i5]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)
- [i4]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)
- 2008
- [j7]Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi: Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Information & Computation 8(3): 345-358 (2008)
- [c11]Akinori Kawachi, Keisuke Tanaka, Keita Xagawa: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. ASIACRYPT 2008: 372-389
- [c10]Akinori Kawachi, Christopher Portmann: On the Power of Quantum Encryption Keys. PQCrypto 2008: 165-180
- 2007
- [j6]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)
- [c9]Akinori Kawachi, Keisuke Tanaka, Keita Xagawa: Multi-bit Cryptosystems Based on Lattice Problems. Public Key Cryptography 2007: 315-329
- 2006
- [j5]Akinori Kawachi, Takeshi Koshiba: Progress in Quantum Computational Cryptography. J. UCS 12(6): 691-709 (2006)
- [c8]Akinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. ICALP (2) 2006: 216-227
- [c7]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita: Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT 2006: 280-291
- [i3]Akinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. CoRR abs/quant-ph/0602088 (2006)
- [i2]Akinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. Electronic Colloquium on Computational Complexity (ECCC) 13(020) (2006)
- [i1]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptology ePrint Archive 2006: 148 (2006)
- 2005
- [j4]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita: Quantum Sampling for Balanced Allocations. IEICE Transactions 88-D(1): 39-46 (2005)
- [j3]Kazuo Iwama, Akinori Kawachi: Compact Routing with Stretch Factor of Less Than Three. IEICE Transactions 88-D(1): 47-52 (2005)
- [j2]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)
- [c6]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284
- 2004
- [c5]Kazuo Iwama, Akinori Kawachi: Approximated Two Choices in Randomized Load Balancing. ISAAC 2004: 545-557
- [c4]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra: Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850
- [c3]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita: Quantum Identification of Boolean Oracles. STACS 2004: 105-116
- 2003
- [j1]Kazuo Iwama, Akinori Kawachi: A New Quantum Claw-finding Algorithm for Three Functions. New Generation Comput. 21(4): 319-327 (2003)
- [c2]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita: Quantum Sampling for Balanced Allocations. COCOON 2003: 304-318
- 2000
- [c1]Kazuo Iwama, Akinori Kawachi: Compact routing with stretch factor of less than three (brief announcement). PODC 2000: 337
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-15 19:12 CET by the dblp team