Crossover between Quantum Information Theory and Quantum Computational Complexity Theory

• Project/Area Number: 18300002
• Research Category: Grant-in-Aid for Scientific Research (B)
• Allocation Type: Single-year Grants
• Section: 一般
• Research Field: Fundamental theory of informatics
• Research Institution: Saitama University
• Principal Investigator: KOSHIBA Takeshi Saitama University, 大学院・理工学研究科, 准教授 (60400800)
• Co-Investigator(Kenkyū-buntansha): MATSUMOTO Keiji 国立情報学研究所, 准教授 (60272390) ; KOBAYASHI Hirotada 国立情報学研究所, プロジェクト研究員 (60413936) ; KAWACHI Akinori 東京工業大学, 大学院・情報理工学研究科, 助教 (00397035)
• Project Period (FY): 2006 – 2008
• Project Status: Completed (Fiscal Year 2008)
• Budget Amount: ¥13,660,000 (Direct Cost: ¥11,500,000、Indirect Cost: ¥2,160,000); Fiscal Year 2008: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000); Fiscal Year 2007: ¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000); Fiscal Year 2006: ¥4,300,000 (Direct Cost: ¥4,300,000)
• Keywords: 量子計算理論 / 量子情報理論 / 暗号理論 / 量子アルゴリズム / 量子情報 / 量子計算 / 量子暗号 / 対話証明 / 隠れ部分群 / エンタングルメント

Research Abstract

We investigated the potential abilities of quantum information processing from the viewpoints of interactive proofs, theory of cryptography and algorithms. We showed that quantum entanglement is effective in multi-prover systems, proposed a non-interactive bit commitment scheme, and derived a limitation of quantum algorithms for the hidden subgroup problem.

Research Products

• [Journal Article] Statistically hiding quantum bit commitment from approximable preimage size quantum one-way function (2009)
  • Author(s): T. Koshiba, T. Odaira
  • Journal Title: Lecture Notes in Computer Science Vol. 5906 Pages: 33-46
  • NAID: 110007227304
  • Peer Reviewed
• [Journal Article] Quantum measurements for hidden subgroup problems with optimal sample complexity (2008)
  • Author(s): M. Hayashi, A. Kawachi, H. Kobayashi
  • Journal Title: Quantum Information and Computation Vol. 8 Pages: 345-358
  • Peer Reviewed
• [Journal Article] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems (2008)
  • Author(s): T. Ito, H. Kobayashi, D. Preda, X. Sun, A. C.-C. Yao
  • Journal Title: Proc. 23^<rd> Annual IEEE Conference on Computational Complexity Pages: 187-198
  • Peer Reviewed
• [Journal Article] Using entanglement in quantum multi-prover interacitve proofs (2008)
  • Author(s): J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
  • Journal Title: Proc. 23^<rd> Annual IEEE Conference on Computational Complexity Pages: 211-222
  • Peer Reviewed
• [Journal Article] A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions (2008)
  • Author(s): K. Kurosawa, W. Kishimoto, T. Koshiba
  • Journal Title: IEEE Transactions on Information Theory Vol. 54 Pages: 2566-2571
  • Peer Reviewed
• [Journal Article] Concurrently secure identification schemes based on the worst-case hardness of lattice problems (2008)
  • Author(s): A. Kawachi, K. Tanaka, K. Xagawa
  • Journal Title: Lecture Notes in Computer Science Vol. 5350 Pages: 372-389
  • Peer Reviewed
• [Journal Article] On the power of quantum encryption keys (2008)
  • Author(s): A. Kawachi, C. Portmann
  • Journal Title: Lecture Notes in Computer Science Vol. 5299 Pages: 165-180
  • Peer Reviewed
• [Journal Article] Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification (2008)
  • Author(s): K. Kurosawa, T. Koshiba
  • Journal Title: Lecture Notes in Computer Science Vol. 5155 Pages: 199-209
  • Peer Reviewed
• [Journal Article] Quantum measurements for hidden subgroup problems with optimal sample complexity (2008)
  • Author(s): M. Hayashi, A. Kawachi, H. Kobayashi
  • Journal Title: Quantum Information and Computation Vol.8 Pages: 345-358
  • Peer Reviewed
• [Journal Article] On the power of quantum encryption keys (2008)
  • Author(s): A. Kawachi, C. Portmann
  • Journal Title: Lecture Notes in Computer Science Vol.5299 Pages: 165-180
  • Peer Reviewed
• [Journal Article] Using entanglement in quantum multi-prover interacitve proofs (2008)
  • Author(s): J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
  • Journal Title: Proc.23^<rd> Annual IEEE Conference on Computational Complexity Pages: 211-222
  • Peer Reviewed
• [Journal Article] Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification (2008)
  • Author(s): Kaoru Kurosawa, Takeshi Koshiba
  • Journal Title: Lecture Notes in Computer Science 5155 Pages: 199-209
  • Peer Reviewed
• [Journal Article] A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions (2008)
  • Author(s): Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba
  • Journal Title: IEEE Transactions on Information Theory 54 Pages: 2566-2571
  • Peer Reviewed
• [Journal Article] Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity (2008)
  • Author(s): Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi
  • Journal Title: Quantum Information and Computation Journal 8 Pages: 345-358
  • Peer Reviewed
• [Journal Article] Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (2008)
  • Author(s): Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
  • Journal Title: Lecture Notes in Computer Science 5350 Pages: 372-389
  • Peer Reviewed
• [Journal Article] On the Power of Quantum Encryption Keys (2008)
  • Author(s): Akinori Kawachi and Christ onher Portmann
  • Journal Title: Lecture Notes in Computer Science 5299 Pages: 165-180
  • Peer Reviewed
• [Journal Article] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems (2008)
  • Author(s): Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew C. -C. Yao
  • Journal Title: Proc. Twenty-Third Annual IEEE Conference on Computational Complexity Pages: 187-198
  • Peer Reviewed
• [Journal Article] Using entanglement in quantum multi-prover interactive proofs (2008)
  • Author(s): Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
  • Journal Title: Proc. Twenty-Third Annual IEEE Conference on Computational Complexity Pages: 211-222
  • Peer Reviewed
• [Journal Article] A Combinatorial Approach to Derivng Lower Bounds for Perfectly Secure Oblivious Transfer Reductions (2008)
  • Author(s): K.Kurosawa, W.Kishimoto, T.Koshiba
  • Journal Title: IEEE Transactions on Information Theory (採録決定済)
  • Peer Reviewed
• [Journal Article] Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity (2008)
  • Author(s): M.Hayashi, A.Kawachi, H.Kobayashi
  • Journal Title: Quantum Information and Computation 8(3-4) Pages: 345-358
  • Peer Reviewed
• [Journal Article] Using Entanglement in Quantum Multi-Prover Interactive Proofs (2008)
  • Author(s): J.Kempe, H.Kobayashi, K.Matsumoto, T.Vidick
  • Journal Title: Proc.23rd Annual IEEE Conference on Computational Complexity (採録決定)
  • Peer Reviewed
• [Journal Article] More on security of public-key cryptography based on Chebyshev polynomials (2007)
  • Author(s): K.-Y. Cheong, T. Koshiba
  • Journal Title: IEEE Transactions on Circuits and Systems II Vol. 54 Pages: 795-799
  • Peer Reviewed
• [Journal Article] Low-density attack revisited, Desings (2007)
  • Author(s): T. Izu, J. Kogure, T. Koshiba, T. Shimoyama
  • Journal Title: Codes and Cryptography Vol. 43 Pages: 47-59
  • Peer Reviewed
• [Journal Article] Multi-bit cryptosystems based on lattice problems (2007)
  • Author(s): A. Kawachi, K. Tanaka, K. Xagawa
  • Journal Title: Lecture Notes in Computer Science Vol. 4450 Pages: 315-329
  • Peer Reviewed
• [Journal Article] 量子公開鍵暗号の安全性概念(招待解説論文) (2007)
  • Author(s): 小柴 健史
  • Journal Title: 電子情報通信学会誌 J90A(5) Pages: 367-375
• [Journal Article] More on Security of Public-Key Cryptography Based on Chebyshev Polynomials (2007)
  • Author(s): K.-Y.Cheong, T.Koshiba
  • Journal Title: IEEE Transacti on sonCircuits and Systems II 54(9) Pages: 795-799
  • Peer Reviewed
• [Journal Article] Low-Density Attack Revisited (2007)
  • Author(s): T.Izu, J.Kogure, T.Koshiba, T.Shimoyama
  • Journal Title: Desings, Codes and Cryptography 43(1) Pages: 47-59
  • Peer Reviewed
• [Journal Article] Multi-Bit Cryptosystems Based on Lattice Problems (2007)
  • Author(s): A.Kawachi, K.Tanaka, K.Xagawa
  • Journal Title: Lecture Notes in Computer Science(PKC 2007) 4450 Pages: 315-329
  • Peer Reviewed
• [Journal Article] Generalized Tsirelson Inequalities,Commuting-Operator Provers,and Multi-Prover Interactive Proof Systems (2007)
  • Author(s): T.Ito, H.Kobayashi, D.Preda, X.Sun, A.C.-C.Yao
  • Journal Title: Proc.23rd Annual IEEE Conference on Computational Complexity (採録決定)
  • Peer Reviewed
• [Journal Article] Progress in quantum computational cryptography (2006)
  • Author(s): A. Kawachi, T. Koshiba
  • Journal Title: Journal of Universal Computer Science Vol. 12 Pages: 691-709
• [Journal Article] Progress in Quantum Computational Cryptography (2006)
  • Author(s): A.Kawachi, T.Koshiba
  • Journal Title: Journal of Universal Computer Science 12(6) Pages: 691-709
• [Journal Article] Statistically hiding quantum bit commitment from approximable preimage size quantum one-way function
  • Author(s): T. Koshiba, T. Odaira
  • Journal Title: Lecture Notes in Computer Science (採録決定済)
  • NAID: 110007227304
  • Peer Reviewed
• [Journal Article] Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
  • Author(s): Takanori Odaira, Takeshi Koshiba
  • Journal Title: Lecture Notes in Computer Science (掲載確定)
  • NAID: 110007227304
  • Peer Reviewed
• [Presentation] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems (2009)
  • Author(s): Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew C.-C. Yao
  • Organizer: Twenty-Third Annual IEEE Conference on Computational Complexity
  • Place of Presentation: College Park, Maryland, USA
  • Year and Date: 2009-06-25
• [Presentation] Oracularization and two-prover one-round interactive proofs against nonlocal strategies (2009)
  • Author(s): T. Ito, H. Kobayashi, K. Matsumoto
  • Organizer: The 12^<th> Workshop on Quantum Information Processing
  • Place of Presentation: Santa Fe, USA
  • Year and Date: 2009-01-14
• [Presentation] Oracularization and two-prover one-round interactive proofs against nonlocal strategies (2009)
  • Author(s): Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
  • Organizer: The12th Workshop on Quantum Information Processing
  • Place of Presentation: Santa Fe, USA
  • Year and Date: 2009-01-14
• [Presentation] oncurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (2008)
  • Author(s): Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
  • Organizer: ASIACRYPT 2008
  • Place of Presentation: Melbourne,Australia
  • Year and Date: 2008-12-10
• [Presentation] On the Power of Quantum Encryption Keys (2008)
  • Author(s): Akinori Kawachi and Christonher Portmann
  • Organizer: The. Second international Workshop on Post-Quantum Cryptography (PQCrypto 2008)
  • Place of Presentation: シンシナティ,USA
  • Year and Date: 2008-10-19
• [Presentation] On quantum oblivious transfer (2008)
  • Author(s): T. Koshiba
  • Organizer: JST-CNRS Joint Workshop on Quantum Computer : Theory and Feasibility
  • Place of Presentation: Paris, France
  • Year and Date: 2008-09-25
• [Presentation] Relations between orthogonality and linear independence (2008)
  • Author(s): M. Hagiwara, A. Kawachi
  • Organizer: JST-CNRS Joint Workshop on Quantum Computer : Theory and Feasibility
  • Place of Presentation: Paris, France
  • Year and Date: 2008-09-25
• [Presentation] Relations between Orthogonality and Linear Independence (2008)
  • Author(s): Minato Hagiwara and Akinori Kawachi
  • Organizer: JST-CNRS Joint Workshop on Quantum Computer: Theory and Feasibility
  • Place of Presentation: パリ,フランス
  • Year and Date: 2008-09-25
• [Presentation] On Quantum Oblivious Transfer (2008)
  • Author(s): Takeshi Koshiba
  • Organizer: JST-CNRS Joint Workshop on Quantum Computer: Theory and Feasibility
  • Place of Presentation: パリ,フランス
  • Year and Date: 2008-09-25
• [Presentation] Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification (2008)
  • Author(s): Kaoru Kurosawa, Takeshi Koshiba
  • Organizer: The 3rd International Conference on Information Theoretic Security, ICITS 2008
  • Place of Presentation: カナダ,カルガリー
  • Year and Date: 2008-08-13
• [Presentation] Hardness Amplification within Polynomial-Time Hierarchy (2008)
  • Author(s): Dan Gutfreund, Akinori Kawachi
  • Organizer: 夏のLAシンポジウム2008
  • Place of Presentation: 和歌山
  • Year and Date: 2008-07-22
• [Presentation] Using entanglement in quantum multi-prover interactive proofs (2008)
  • Author(s): Julia KemPe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
  • Organizer: Twenty-Third Annual IEEE Conference on Computational Complexity
  • Place of Presentation: College Park, Maryland, USA
  • Year and Date: 2008-06-25
• [Presentation] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactiveproof systems (2007)
  • Author(s): T. Ito, H. Kobayashi, D. Preda, X. Sun, A. C.-C. Yao
  • Organizer: The 11^<th> Workshop on Quantum Information Processing
  • Place of Presentation: New Delhi, India
  • Year and Date: 2007-12-17
• [Presentation] Using entanglement in quantum multi-prover interactive proofs (2007)
  • Author(s): J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
  • Organizer: The 11^<th> Workshop on Quantum Information Processing
  • Place of Presentation: New Delhi, India
  • Year and Date: 2007-12-17
• [Presentation] Generalized Tsirelson Inequalities,Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems (2007)
  • Author(s): T. Ito, H. Kobayashi, D. Preda, X. Sun, A. C. -C. Yao
  • Organizer: The 11th Workshop on Quantum Information Processing
  • Place of Presentation: New Delhi
• [Presentation] Using Entanglement in Quantum Multi-Prover Interactive Proofs (2007)
  • Author(s): J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
  • Organizer: The 11th workshop on Quantum Information Procesing
  • Place of Presentation: New Delhi
• [Book] 量子暗号理論の展開 (臨時別冊・数理科学SGCライブラリ67) (2008)
  • Author(s): 小芦雅斗, 小柴健史
  • Publisher: サイエンス社
• [Book] 量子暗号理論の展開(臨時別冊・数理科学SGCライブラリ67) (2008)
  • Author(s): 小芦雅斗, 小柴健史
  • Publisher: サイエンス社
• [Book] 量子暗号理論の展開(臨時別冊・数理科学SGCライブラリ67)
  • Author(s): 小芦雅斗,小柴健史
  • Publisher: サイエンス社