• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2009 Fiscal Year Annual Research Report

量子情報理論と量子計算量理論の融合技術の展開

Research Project

Project/Area Number 21300002
Research InstitutionSaitama University

Principal Investigator

小柴 健史  Saitama University, 理工学研究科, 准教授 (60400800)

Co-Investigator(Kenkyū-buntansha) 田中 圭介  東京工業大学, 情報理工学研究科, 准教授 (20334518)
小林 弘忠  国立情報学研究所, プロジェクト研究員 (60413936)
河内 亮周  東京工業大学, 情報理工学研究科, 助教 (00397035)
松本 啓史  国立情報学研究所, 准教授 (60272390)
Keywords量子情報 / 量子計算 / 量子暗号 / 脱乱択化 / 暗号理論 / 対話証明 / エンタングルメント / 計算量理論
Research Abstract

本年度は,量子対話型証明において証明者間の共有エンタングルメシトの効果に関する研究を行った.検証者は古典のままであるが,証明者らにエンタングルメントを用いることを認める多証明者対話型証明において,PSPACEが2証明者1ラウンド証明を持つことを示した.一方,NEXPに対する2証明者対話型証明構成の既存の試みの問題点を指摘し,3証明者の場合と異なる可能性も指摘した.次に,ネットワーク符号化における量子通信の可能性について研究し,複数対の情報を各情報源から各目的地に送信する問題において,補助的に古典情報を送ることを許せば,古典ネットワーク符号化が可能な全ての通信網で,任意の未知量子状態を効率よく完全に送信することを可能にする符号化技法の構成に成功し,量子ネットワーク符号化の可能性の道を拓いた.また,量子計算と暗号理論の境界領域の研究として,量子一方向性関数の逆計算の困難性および量子ビット委託方式について考察した.特に,量子一方向性関数から量子計算機に対しても安全で,かつ今までに知られていないようなハードコア述語を構成することに成功した.ハードコア述語は暗号理論において重要かつ基礎的な概念であり,量子計算理論的な観点から暗号理論に新たな視点を導入するものと期待できる.また,量子情報および量子計算へのフィードバックを掛ける意味で,古典対話型証明の研究も同時に遂行した.古典対話型証明における乱数の重要性について考察し,ある種の乱数を用いた対話型証明が乱数を必要としない対話型証明で模倣できたとすると,論理回路族に対する非常に高い計算量の下界が得られることを示した.また,古典暗号理論においては,弱い理想化された圧縮関数によるハッシュ関数,tag-KEM/DEMフレームワークと呼ばれる公開鍵暗号方式,より現実的な紛失通信方式に着目し新たな方式の提案や安全性について考察した.

  • Research Products

    (21 results)

All 2010 2009 Other

All Journal Article (12 results) (of which Peer Reviewed: 12 results) Presentation (9 results)

  • [Journal Article] Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding2010

    • Author(s)
      Akinori Kawachi, Tomoyuki Yamakami
    • Journal Title

      SIAM Journal on Computing 39

      Pages: 2941-2969

    • Peer Reviewed
  • [Journal Article] Security of Encryption Schemes in Weakened Random Oracles2010

    • Author(s)
      Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa
    • Journal Title

      Lecture Notes in Computer Science 6056

      Pages: 403-419

    • Peer Reviewed
  • [Journal Article] Using Entanglement in Quantum Multi-Prover Interactive Proofs2009

    • Author(s)
      Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
    • Journal Title

      Computational Complexity 18

      Pages: 273-307

    • Peer Reviewed
  • [Journal Article] Quantum Merlin-Arthur Proof Systems : Are Multiple Merlins More Helpful to Arthur?2009

    • Author(s)
      Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
    • Journal Title

      Chicago Journal of Theoretical Computer Science

      Pages: Article 3

    • Peer Reviewed
  • [Journal Article] Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies2009

    • Author(s)
      Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
    • Journal Title

      Proc.24th Annual IEEE Conference on Computational Complexity

      Pages: 217-228

    • Peer Reviewed
  • [Journal Article] General Scheme for Perfect Quantum Network Coding with Free Classical Communication2009

    • Author(s)
      Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
    • Journal Title

      Lecture Notes in Computer Science 5555

      Pages: 622-633

    • Peer Reviewed
  • [Journal Article] Reducing Complexity Assumptions for Oblivious Transfer2009

    • Author(s)
      Kai Yuen Cheong, Takeshi Koshiba
    • Journal Title

      Lecture Notes in Computer Science 5824

      Pages: 110-124

    • Peer Reviewed
  • [Journal Article] Strengthening the Security of Distributed Oblivious Transfer2009

    • Author(s)
      Kai Yuen Cheong, Takeshi Koshiba, Shohei Nishiyama
    • Journal Title

      Lecture Notes in Computer Science 5594

      Pages: 377-388

    • Peer Reviewed
  • [Journal Article] On the Weak Ideal Compression Functions2009

    • Author(s)
      Akira Numayama, Keisuke Tanaka
    • Journal Title

      Lecture Notes in Computer Science 5594

      Pages: 232-248

    • Peer Reviewed
  • [Journal Article] Security on Hybrid Encryption with the Tag-KEM/DEM Framework2009

    • Author(s)
      Toshihide Matsuda, Ryo Nishimaki, Akira Numayama, Keisuke Tanaka
    • Journal Title

      Lecture Notes in Computer Science 5594

      Pages: 343-359

    • Peer Reviewed
  • [Journal Article] Primitive Power Roots of Unity and Its Application to Encryption2009

    • Author(s)
      Takato Hirano, Koichiro Wada, Keisuke Tanaka
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences E92A

      Pages: 1836-1844

    • Peer Reviewed
  • [Journal Article] Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

    • Author(s)
      Dan Gutfreund, Akinori Kawachi
    • Journal Title

      Proc.25th Annual IEEE Conference on Computational Complexity (掲載確定)

    • Peer Reviewed
  • [Presentation] Perfect Quantum Network Coding with Free Classical Communication2010

    • Author(s)
      Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
    • Organizer
      13^<th> Workshop on Quantum Information Processing, QIP 2010
    • Place of Presentation
      Zurich, Switzerland
    • Year and Date
      2010-01-21
  • [Presentation] Monotone'Metric'in the Channel Space : Resource Conversion Approach2010

    • Author(s)
      Keiji Matsumoto
    • Organizer
      13^<th> Workshop on Quantum Information Processing, QIP 2010
    • Place of Presentation
      Zurich, Switzerland
    • Year and Date
      2010-01-20
  • [Presentation] Reducing Complexity Assumptions for Oblivious Transfer2009

    • Author(s)
      Kai Yuen Cheong, Takeshi Koshiba
    • Organizer
      4^<th> International Workshop on Security, IWSEC 2009
    • Place of Presentation
      富山国際会議場(富山市,日本)
    • Year and Date
      2009-10-29
  • [Presentation] Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies2009

    • Author(s)
      Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
    • Organizer
      24^<th> Annual IEEE Conference on Computational Complexity
    • Place of Presentation
      Paris, France
    • Year and Date
      2009-07-17
  • [Presentation] General Scheme for Perfect Quantum Network Coding with Free Classical Communication2009

    • Author(s)
      Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
    • Organizer
      36^<th> International Colloquium on Automata, Languages and Programming, ICALP 2009
    • Place of Presentation
      Rhodes, Greece
    • Year and Date
      2009-07-07
  • [Presentation] Strengthening the Security of Distributed Oblivious Transfer2009

    • Author(s)
      Kai Yuen Cheong, Takeshi Koshiba, Shohei Nishiyama
    • Organizer
      14^<th> Australasian Conference on Information Security and Privacy, ACISP 2009
    • Place of Presentation
      Brisbane, Australia
    • Year and Date
      2009-07-03
  • [Presentation] On the Weak Ideal Compression Functions2009

    • Author(s)
      Akira Numayama, Keisuke Tanaka
    • Organizer
      14^<th> Australasian Conference on Information Security and Privacy, ACISP 2009
    • Place of Presentation
      Brisbane, Australia
    • Year and Date
      2009-07-02
  • [Presentation] Security on Hybrid Encryption with the Tag-KEM/DEM Framework2009

    • Author(s)
      Toshihide Matsuda, Ryo Nishimaki, Akira Numayama, Keisuke Tanaka
    • Organizer
      14^<th> Australasian Conference on Information Security and Privacy, ACISP 2009
    • Place of Presentation
      Brisbane, Australia
    • Year and Date
      2009-07-02
  • [Presentation] Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function2009

    • Author(s)
      Takeshi Koshiba, Takanori Odaira
    • Organizer
      4^<th> Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009
    • Place of Presentation
      Waterloo, Canada
    • Year and Date
      2009-05-11

URL: 

Published: 2011-06-16   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi