論文

• KEISUKE TANAKA, AKINORI KAWACHI, Yoshio Okamoto, Kenji Yasunaga. General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction, THE COMPUTER JOURNAL, Volume 60, 5, 711-728, Dec. 2016.
• Akinori Kawachi, Benjamin Rossman, Osamu Watanabe. The Query Complexity of Witness Finding, Theory of Computing Systems, Vol. 61, No. 2, pp. 305–321, Sept. 2016.
• KEISUKE TANAKA, Eiichiro Fujisaki, AKINORI KAWACHI, Ryo Nishimaki, Kenji Yasunaga. Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences  , Vol. E98-A, No. 3, pp. 853-862, Mar. 2015.
• A. Kawachi, H. Tanaka, O. Watanabe. Estimating the Gowers norm of modulo functions over prime fields, IEICE TRANSACTIONS on Information and Systems, Vol. E95-D, No. 3, pp. 755-762, Mar. 2012.
• Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi. Quantum measurements for hidden subgroup problems with optimal sample complexity, Quantum Information and Computation Journal, Vol. 8, pp. 345-358, Mar. 2008.
• Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita. Improved algorithms for quantum identification of boolean oracles, Theoretical Computer Science, Vol. 378, pp. 41-53, June 2007.
• Kazuo Iwama, Akinori Kawachi. Compact Routing with Stretch Factor of Less Than Three, IEICE trans. Inf. & Sys., Vol. E88-D, No. 1, pp. 39-46, 2005.
• Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita. Quantum Sampling for Balanced Allocations, IEICE trans. Inf. & Sys., Vol. E88-D, No. 1, pp. 47-52, 2005.
• Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Rudy H. Putra. Universal Test for Quantum One-Way Permutations, Theor. Comput. Sci., Vol. 345, No. 22, pp. 370-385, 2005.
• Kazuo Iwama, Akinori Kawachi. A New Quantum Claw-finding Algorithm for Three Functions, New Generation Comput., Vol. 21, No. 2, 2003.

国際会議発表 (査読有り)

• KEISUKE TANAKA, AKINORI KAWACHI, hirotoshi takebe. Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes, 11th International Workshop on Security, Advances in Information and Computer Security, pp. 195-211, Sept. 2016.
• Akinori Kawachi, Benjamin Rossman, Osamu Watanabe. The query complexity of witness finding, Proc. of the 9th International Computer Science Symposium in Russia (CSR14), Lecture Notes in Computer Science, Springer Berlin Heidelberg, Vol. 8476, pp. 218-231, 2014.
• KEISUKE TANAKA, Akinori Kawachi, Hirotoshi Takebe. Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability, 7th International Workshop on Security, Advances in Information and Computer Security, pp. 123-137, Oct. 2012.
• KEISUKE TANAKA, Akinori Kawachi, Christopher Portmann. Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity, 5th International Conference on Information Theoretic Security, Information Theoretic Security, pp. 6-24, May 2011.
• KEISUKE TANAKA, Akinori Kawachi, Akira Numayama, Keita Xagawa. Security of Encryption Schemes in Weakened Random Oracle Models, 13th International Conference on Practice and Theory in Public Key Cryptography, Public Key Cryptography, pp. 403-419, May 2010.
• AKINORI KAWACHI, KEISUKE TANAKA, Keita Xagawa. Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, Advances in Cryptology - Asiacrypt 2008 (ASIACRYPT 2008), Advances in Cryptology - Asiacrypt 2008 (ASIACRYPT 2008), Vol. 5350, pp. 372-389, Dec. 2008.
• Akinori Kawachi, Christopher Portmann. On the power of quantum encryption keys, The Second International Workshop on Post-Quantum Cryptography (PQCrypto 2008), Lecture Notes in Computer Science, Vol. 5299, pp. 165-180, Oct. 2008.
• Akinori Kawachi, Keisuke Tanaka, Keita Xagawa. Multi-bit cryptosystems based on lattice problems, Public Key Cryptography - PKC 2007, Lecture Notes in Computer Science, Vol. 4450, pp. 315-329, June 2007.
• AKINORI KAWACHI, KEISUKE TANAKA, Keita Xagawa. Multi-Bit Cryptosystems Based on Lattice Problems, PKC 2007, 110th International Workshop on Practice and Theory in Public Key Cryptography (PKC2007), Public Key Cryptography - PKC 2007, 10th International Workshop on Practice and Theory in Public Key Cryptography, Lecture Notes in Computer Science 4450, pp. 315-329, Apr. 2007.

国際会議発表 (査読なし・不明)

• Minato Hagiwara, Akinori Kawachi. Relations between orthogonality and linear independence, JST-CNRS Joint Workshop on Quantum Computation: Theory and Feasibility, Sept. 2008.
• Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami. Computational Indistinguishability between Quantum States and Its Cryptographic Application, Eurocrypt 2005, LNCS, Vol. 3494, pp. 268--284, 2005.
• Kazuo Iwama, Akinori Kawachi. Approximated Two Choices in Randomized Load Balancing, ISAAC 2005, LNCS, Vol. 3342, pp. 545-557, 2005.
• Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita. Quantum Identification of Boolean Oracles, STACS 2004, LNCS, Vol. 2996, pp. 105-116, 2004.
• Kazuo Iwama, Akinori Kawachi. Quantum Sampling for Balanced Allocations, COCOON 2003, LNCS, Vol. 2697, 2003.

国内会議発表 (査読なし・不明)

• KEISUKE TANAKA, Akinori Kawachi, Hirotoshi Takebe. Lower Bounds for Key Length of Non-malleable Symmetric-Key Encryption Schemes, The 30th Symposium on Cryptography and Information Security, Jan. 2013.
• 田中圭介, 河内亮周, 竹部裕俊. K-wise almost independent permutationの記述長の下界, 2012年度冬のLAシンポジウム, Jan. 2013.
• KEISUKE TANAKA, hirotoshi takebe, AKINORI KAWACHI. Symmetric-Key Encryption Schemes with Approximate Non-malleability, 2012年暗号とセキュリティシンポジウム, Jan. 2012.
• 河内亮周, 岡本吉央, 田中圭介, 安永憲司. 合理的なプレイヤーは合理的な暗号プロトコルを避ける, 2009年度冬のLAシンポジウム, Feb. 2010.
• KEISUKE TANAKA, AKINORI KAWACHI, Yoshio Okamoto, Kenji Yasunaga. One-round reconstruction for rational secret sharing, 2010年暗号と情報セキュリティシンポジウム, Jan. 2010.
• 田中圭介, 河内 亮周, 草川 恵太. ルジャンドル列の擬似乱数性と頑健な量子状態復号, the 2010 Symposium on Cryptography and Information Security, Jan. 2010.
• KEISUKE TANAKA, AKINORI KAWACHI, Akira Numayama, Keita Xagawa. Security of the OAEP Encryption Scheme in the Weakened Random Oracle Models, 2009年 暗号と情報セキュリティシンポジウム, 2009年 暗号と情報セキュリティシンポジウム, pp. 3D1-2, Jan. 2009.
• 田中圭介, 河内亮周, 沼山晃, 草川恵太. 近似サンプリング法の精度保証, 2009年 暗号とセキュリティシンポジウム, 2009年 暗号とセキュリティシンポジウム, pp. 3D1-1, Jan. 2009.
• Dan Gutfrend, Akinori Kawachi. Worst-case hardness amplification within polynomial-time hierarchy, 2008年度夏のLAシンポジウム, Aug. 2008.
• 沼山晃, 河内亮周, 草川恵太, 田中圭介. 統計的距離を考慮したサンプリング, 2008年夏のLAシンポジウム, July 2008.
• 田中秀宗, 河内亮周. Gowers一様性による剰余関数と多項式の相関の評価, 2007年度冬のLAシンポジウム, Feb. 2008.
• 田中圭介, 草川 恵太, 河内 亮周. 格子問題に基づくコンパクトな署名方式, 2008 年暗号と情報セキュリティシンポジウム, Jan. 2008.
• 田中圭介, 草川恵太, 河内亮周. 格子問題に基づく高い安全性をもつ認証方式, 2008年 暗号と情報セキュリティシンポジウム, 2008年 暗号と情報セキュリティシンポジウム, pp. 3D3-1, Jan. 2008.
• Christopher Portmann, 河内亮周. 量子非対称鍵暗号の最適性について, 2008年暗号と情報セキュリティシンポジウム（SCIS2008）, Jan. 2008.
• 草川恵太, 河内亮周, 田中圭介. 格子問題に基づく認証および署名方式, 2007年度夏のLAシンポジウム, July 2007.
• Akinori Kawachi, Christopher Portmann. Near-Optimal Quantum Asymmetric-Key Cryptosystem, 2007年度夏のLAシンポジウム, July 2007.
• Keita Xagawa, AKINORI KAWACHI, Keisuke Tanaka. Multi-Bit Cryptosystems based on Lattice Problems, 2006年 暗号と情報セキュリティシンポジウム, 2006年 暗号と情報セキュリティシンポジウム 予稿集, pp. 2A4-4, Jan. 2006.

その他の論文・著書など

• Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita. Quantum Biased Oracles, IPSJ Journal, Vol. 46, No. 10, pp. 2400-2408, 2005.

学位論文

• Studies on Quantum Query Complexity and Quantum Cryptography,  本文,  Doctor,  Kyoto University,  2004/--/--, 

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]