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

Advances in crossover between quantum information theory and quantum computational complexity theory

Research Project

Project/Area Number 21300002
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionSaitama University

Principal Investigator

KOSHIBA Takeshi  埼玉大学, 大学院・理工学研究科, 准教授 (60400800)

Co-Investigator(Kenkyū-buntansha) MATSUMOTO Keiji  国立情報学研究所, 情報学プリンシプル研 究系, 准教授 (60272390)
KOBAYASHI Hirotada  国立情報学研究所, 情報学プリンシプル研 究系, 研究員 (60413936)
TANAKA Keisuke  東京工業大学, 大学院・情報理工学研究科, 准教授 (20334518)
KAWACHI Akinori  東京工業大学, 大学院・情報理工学研究科, 助教 (00397035)
Project Period (FY) 2009 – 2011
Project Status Completed (Fiscal Year 2011)
Budget Amount *help
¥14,430,000 (Direct Cost: ¥11,100,000、Indirect Cost: ¥3,330,000)
Fiscal Year 2011: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2010: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2009: ¥5,980,000 (Direct Cost: ¥4,600,000、Indirect Cost: ¥1,380,000)
Keywords量子計算量理論 / 量子情報理論 / 暗号理論 / 量子アルゴリズム / 量子暗号 / 対話証明 / エンタングルメント / 量子情報 / 量子計算 / 計算量理論 / ネットワーク符号 / 脱乱択化
Research Abstract

We developed useful techniques in quantum information theory and quantum computational complexity theory and applied them to interactive proof systems, cryptography, network theory and so on. With respect to quantum interactive proof systems, we investigated effects of quantum entanglements among multiple provers. Moreover, we considered the possibility of quantum communication in network coding and proposed efficient protocols. We proved the hard-core property of a function by the quantum computational complexity theory, while it had not been proved from the classical theory. Furthermore, we proposed several classical cryptographic protocols, which bring some ideas to quantum cryptography.

Report

(4 results)
  • 2011 Annual Research Report   Final Research Report ( PDF )
  • 2010 Annual Research Report
  • 2009 Annual Research Report
  • Research Products

    (83 results)

All 2012 2011 2010 2009 Other

All Journal Article (46 results) (of which Peer Reviewed: 46 results) Presentation (36 results) Book (1 results)

  • [Journal Article] An efficient non-interactive universally composable string-commitment scheme2012

    • Author(s)
      R. Nishimaki, E. Fujisaki, K. Tanaka
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and ComputerSciences

      Volume: E95A Pages: 167-175

    • NAID

      10030534708

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] A multi-trapdoor commitment scheme from the RSA assumption2012

    • Author(s)
      R. Nishimaki, E. Fujisaki, K. Tanaka
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E95A Pages: 176-184

    • NAID

      10030534728

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Estimating the Gowers norm of modulo functions over prime fields2012

    • Author(s)
      A. Kawachi, H. Tanaka, O. Watanabe
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E95D Pages: 755-762

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems2012

    • Author(s)
      S.P.Jordan, H.Kobayashi, D.Nagaj, H.Nishimura
    • Journal Title

      Quantum Information and Computation

      Volume: 12 Pages: 461-471

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Estimating the Gowers Norm of Modulo Functions over Prime Fields2012

    • Author(s)
      A.Kawachi, H.Tanaka, O.Watanabe
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E95-D Issue: 3 Pages: 755-762

    • DOI

      10.1587/transinf.E95.D.755

    • NAID

      10030611565

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Efficient Non-interactive Universally Composable String-Commitment Scheme2012

    • Author(s)
      R.Nishimaki, E.Fujisaki, K.Tanaka
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E95-A Issue: 1 Pages: 167-175

    • DOI

      10.1587/transfun.E95.A.167

    • NAID

      10030534708

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Multi-Trapdoor Commitment Scheme from the RSA Assumption2012

    • Author(s)
      R.Nishimaki, E.Fujisaki, K.Tanaka
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E95-A Issue: 1 Pages: 176-184

    • DOI

      10.1587/transfun.E95.A.176

    • NAID

      10030534728

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity2011

    • Author(s)
      A. Kawachi, C. Portmann, K. Tanaka
    • Journal Title

      Lecture Notes in Computer Science 6673 (ICITS 2011)

      Pages: 6-24

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Hard functions for low-degree polynomials over prime fields2011

    • Author(s)
      A. Bogdanov, A. Kawachi, H. Tanaka
    • Journal Title

      Lecture Notes in Computer Science 6907 (MFCS 2011)

      Pages: 120-131

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Weak oblivious transfer from strong one-way functions2011

    • Author(s)
      K. Tanaka, A. Yamada, K. Yasunaga
    • Journal Title

      Lecture Notes in Computer Science 6980 (ProvSec 2011)

      Pages: 34-51

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Randomness leakage in the KEM/DEM framework2011

    • Author(s)
      H. Namiki, K. Tanaka, K. Yasunaga
    • Journal Title

      Lecture Notes in Computer Science 6980 (ProvSec 2011)

      Pages: 309-323

    • NAID

      130003385344

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Programmabilityin the generic ring and group models2011

    • Author(s)
      M. Larangeira, K. Tanaka
    • Journal Title

      Journal of Internet Services and Information Security 1

      Pages: 57-73

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Test of purity by LOCC2011

    • Author(s)
      K. Matsumoto
    • Journal Title

      Progress in Informatics 8

      Pages: 111-113

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Information-theoretic secrecy with access to decryption oracles, IEICE Transactions on Fundamentals of Electronics2011

    • Author(s)
      C. Portmann, K. Tanaka
    • Journal Title

      Communications and Computer SciencesE94A

      Pages: 1585-1590

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Public discussion must be back and forth in Secure Message Transmission2011

    • Author(s)
      T. Koshiba, S. Sawada
    • Journal Title

      Lecture Notes in Computer Science 6829 (ICISC 2010)

      Pages: 325-337

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Information-Theoretic Secrecy with Access to Decryption Oracles2011

    • Author(s)
      C.Portmann, K.Tanaka
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E94-A Issue: 7 Pages: 1585-1590

    • DOI

      10.1587/transfun.E94.A.1585

    • NAID

      10029803009

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Programmability in the Generic Ring and Group Models2011

    • Author(s)
      M.Larangeira, K.Tanaka
    • Journal Title

      Journal of Internet Services and Information Security

      Volume: 1 Pages: 57-73

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Quantum hardcore functions by complexity-theoretical quantum list decoding2010

    • Author(s)
      A. Kawachi, T. Yamakami
    • Journal Title

      SIAM Journal on Computing

      Volume: 39 Pages: 2941-2969

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] CCAproxy re-encryption without bilinear maps in the standard model2010

    • Author(s)
      T. Matsuda, R. Nishimaki, K. Tanaka
    • Journal Title

      Lecture Notes in Computer Science 6056 (PKC 2010)

      Pages: 261-278

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Security of encryption schemes in weakened random oracles2010

    • Author(s)
      A. Kawachi, A. Numayama, K. Tanaka, K.Xagawa
    • Journal Title

      Lecture Notes in Computer Science 6056 (PKC 2010)

      Pages: 403-419

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Key generation for fast inversion of the Paillier encryption function, IEICE Trans. on Fundamentals of Electronics2010

    • Author(s)
      T. Hirano, K. Tanaka
    • Journal Title

      Communications and Computer Sciences E93A

      Pages: 1111-1121

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Key Generation for Fast Inversion of the Paillier Encryption Function2010

    • Author(s)
      T.Hirano, K.Tanaka
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E93-A Pages: 1111-1121

    • NAID

      10026864729

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model2010

    • Author(s)
      T.Matsuda, R.Nishimaki, K.Tanaka
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6056 Pages: 261-278

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Multi-trapdoor Commitment Scheme from the RSA Assumption2010

    • Author(s)
      R.Nishimaki, E.Fujisaki, K.Tanaka
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6168 Pages: 182-199

    • NAID

      10030534728

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2009 Annual Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Using entanglement in quantum multi-prover interactive proofs2009

    • Author(s)
      J. Kempe, H. Kobayashi, K. Matsumoto, T.Vidick
    • Journal Title

      Computational Complexity

      Volume: 18 Pages: 273-307

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?2009

    • Author(s)
      H. Kobayashi, K. Matsumoto, T. Yamakami
    • Journal Title

      Chicago Journal of Theoretical ComputerScience, Article 3

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
    • Journal Title

      Lecture Notes in Computer Science 5555 (ICALP 2009)

      Pages: 622-633

    • NAID

      110007227302

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] On the weak ideal compression functions2009

    • Author(s)
      A. Numayama, K. Tanaka
    • Journal Title

      Lecture Notes in Computer Science 5594 (ACISP 2009)

      Pages: 232-248

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Security on hybrid encryption with the tag-KEM/DEM framework2009

    • Author(s)
      T. Matsuda, R. Nishimaki, A. Numayama, K.Tanaka
    • Journal Title

      Lecture Notes in Computer Science 5594 (ACISP2009)

      Pages: 343-359

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Strengthening the security of distributed oblivious transfer2009

    • Author(s)
      K. -Y. Cheong, T. Koshiba, S. Nishiyama
    • Journal Title

      Lecture Notes in Computer Science 5594 (ACISP 2009)

      Pages: 377-388

    • NAID

      110007338422

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Reducing complexity assumptions for oblivious transfer2009

    • Author(s)
      K. -Y. Cheong, T. Koshiba
    • Journal Title

      Lecture Notes in Computer Science5824 (IWSEC 2009)

      Pages: 110-124

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Primitive power roots of unity and its application to encryption, IEICE Trans. on Fundamentals of Electronics2009

    • Author(s)
      T. Hirano, K. Wada, K. Tanaka
    • Journal Title

      Communications and Computer Sciences E92A

      Pages: 1836-1844

    • Related Report
      2011 Final Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • 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

    • NAID

      110007227302

    • Related Report
      2009 Annual Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • 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

    • NAID

      110007338422

    • Related Report
      2009 Annual Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • 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

    • Related Report
      2009 Annual Research Report
    • 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

    • NAID

      10026858754

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Computational Indistinguishability of Quantum States and Its Cryptographic Application

    • Author(s)
      A.Kawachi, T.Koshiba, H.Nishimura, T.Yamakami
    • Journal Title

      Journal of Cryptology

      Volume: 印刷中

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Test of Purity

    • Author(s)
      K.Matsumoto
    • Journal Title

      Progress in Informatics

      Volume: 印刷中

    • Related Report
      2010 Annual Research Report
    • 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 (掲載確定)

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Presentation] Quantum interactive proofs with weak error bounds2012

    • Author(s)
      T. Ito, H. Kobayashi, J. Watrous
    • Organizer
      Innovations in Theoretical ComputerScience 2012 (ITCS 2012)
    • Place of Presentation
      Cambridge, MA, USA
    • Year and Date
      2012-01-09
    • Related Report
      2011 Final Research Report
  • [Presentation] Quantum interactive proofs with weak error bounds2012

    • Author(s)
      T.Ito, H, Kobayashi J.Watrous
    • Organizer
      Innovations in Theoretical Computer Science 2012
    • Place of Presentation
      Cambridge, MA, USA
    • Year and Date
      2012-01-09
    • Related Report
      2011 Annual Research Report
  • [Presentation] Hard Functions for Low-Degree Polynomials over Prime Fields2011

    • Author(s)
      A.Bogdanov, A.Kawachi, H.Tanaka
    • Organizer
      36th International Symposium on Mathematical Foundations of Computer Science
    • Place of Presentation
      Warsaw, Poland
    • Year and Date
      2011-08-22
    • Related Report
      2011 Annual Research Report
  • [Presentation] Randomness Leakage in the KEM/DEM Framework2011

    • Author(s)
      H.Namiki, K.Tanaka, K.Yasunaga
    • Organizer
      5th International Conference on Provable Security
    • Place of Presentation
      西安,中国
    • Year and Date
      2011-08-17
    • Related Report
      2011 Annual Research Report
  • [Presentation] Weak Oblivious Transfer from Strong One-Way Functions2011

    • Author(s)
      K.Tanaka, A.Yamada, K.Yasunaga
    • Organizer
      5th International Conference on Provable Security
    • Place of Presentation
      西安,中国
    • Year and Date
      2011-08-16
    • Related Report
      2011 Annual Research Report
  • [Presentation] Leakage-resilient CCA2 public-key encryption from 4-wise independent hash functions2011

    • Author(s)
      M. -H. Nguyen, K. Tanaka, K. Yasunaga
    • Organizer
      2011 International Conference on Advanced Technologies for Communications
    • Place of Presentation
      Nang, Vietnam
    • Year and Date
      2011-08-02
    • Related Report
      2011 Final Research Report
  • [Presentation] Leakage-Resilient CCA2 Public-Key Encryption from 4-wise independent hash functions2011

    • Author(s)
      M.-H.Nguyen, K.Tanaka, K.Yasunaga
    • Organizer
      2011 International Conference on Advanced Technologies for Communications
    • Place of Presentation
      Da Nang, Vietnam
    • Year and Date
      2011-08-02
    • Related Report
      2011 Annual Research Report
  • [Presentation] Constructing quantum network coding schemes from classical nonlinear protocols2011

    • Author(s)
      H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
    • Organizer
      2011 IEEE InternationalSymposium on Information Theory (ISIT2011)
    • Place of Presentation
      St. Petersburg, Russia
    • Year and Date
      2011-08-01
    • Related Report
      2011 Final Research Report
  • [Presentation] Constructing quantum network coding schemes from classical nonlinear protocols2011

    • Author(s)
      H.Kobayashi, F.Le Gall, H.Nishimura, M.Rotteler
    • Organizer
      2011 IEEE International Symposium on Information Theory
    • Place of Presentation
      St.Potersburg, Russia
    • Year and Date
      2011-08-01
    • Related Report
      2011 Annual Research Report
  • [Presentation] Characterization of the Relations between Informution-Theoretic Non-malleability, Secrecy, and Authenticity2011

    • Author(s)
      A.Kawachi, C.Portmann, K.Tanaka
    • Organizer
      5th International Conference on Information Theoretic Security
    • Place of Presentation
      Amsterdam, The Netherlands
    • Year and Date
      2011-05-22
    • Related Report
      2011 Annual Research Report
  • [Presentation] Constructing quantum network coding schemes from classical nonlinear protocols2011

    • Author(s)
      H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
    • Organizer
      The 14th Workshop on QuantumInformation Processing (QIP 2011)
    • Place of Presentation
      Singapore
    • Year and Date
      2011-01-13
    • Related Report
      2011 Final Research Report
  • [Presentation] Constructing quantum network coding schemes from classical nonlinear Protocols2011

    • Author(s)
      H.Kobayashi, F.Le Gall, H.Nishimura, M.Roetteler
    • Organizer
      The 14^<th> Workshop on Quantum Information Processing (QIP 2011)
    • Place of Presentation
      Singapore
    • Year and Date
      2011-01-13
    • Related Report
      2010 Annual Research Report
  • [Presentation] Non-interactive statistically-hiding quantum bit commitment from any quantum one-way function2011

    • Author(s)
      T. Koshiba, T. Odaira
    • Organizer
      The 14th Workshop on Quantum Information Processing (QIP 2011)
    • Place of Presentation
      Singapore
    • Year and Date
      2011-01-11
    • Related Report
      2011 Final Research Report
  • [Presentation] Non-interactive statistically-hiding quantum bit commitment from any quantum one-way function2011

    • Author(s)
      T.Koshiba, T.Odaira
    • Organizer
      The 14^<th> Workshop on Quantum Information Processing (QIP 2011)
    • Place of Presentation
      Singapore
    • Year and Date
      2011-01-11
    • Related Report
      2010 Annual Research Report
  • [Presentation] Quantum interactive proofs with weak error bounds2011

    • Author(s)
      T. Ito, H. Kobayashi, J. Watrous
    • Organizer
      The 14th Workshop on Quantum Information Processing (QIP 2011)
    • Place of Presentation
      Singapore
    • Year and Date
      2011-01-10
    • Related Report
      2011 Final Research Report
  • [Presentation] Quantum interactive proofs with weak error bounds2011

    • Author(s)
      T.Ito, H.Kobayashi, J.Watrous
    • Organizer
      The 14^<th> Workshop on Quantum Information Processing (QIP 2011)
    • Place of Presentation
      Singapore
    • Year and Date
      2011-01-10
    • Related Report
      2010 Annual Research Report
  • [Presentation] Public discussion must be back and forth in Secure Message Transmissi on2010

    • Author(s)
      T.Koshiba, S.Sawada
    • Organizer
      The 13^<th> International Conference on Information Security and Cryptology
    • Place of Presentation
      Seoul, Korea
    • Year and Date
      2010-12-03
    • Related Report
      2010 Annual Research Report
  • [Presentation] Perfect quantum network communication protocol based on classical network coding2010

    • Author(s)
      H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
    • Organizer
      2010 IEEE International Symposium on Information Theory (ISIT2010)
    • Place of Presentation
      Austin, Texas,USA
    • Year and Date
      2010-06-18
    • Related Report
      2011 Final Research Report
  • [Presentation] Perfect quantum network communication protocol based on classical network coding2010

    • Author(s)
      H.Kobayashi, F.Le Gall, H.Nishimura, M.Roetteler
    • Organizer
      2010 IEEE International Symposium on Informati on Theory
    • Place of Presentation
      Austin, Texas, USA
    • Year and Date
      2010-06-18
    • Related Report
      2010 Annual Research Report
  • [Presentation] Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds2010

    • Author(s)
      D. Gutfreund, A. Kawachi
    • Organizer
      The 25th Annual IEEE Conference on Computational Complexity (CCC 2010)
    • Place of Presentation
      Cambridge,Massachusettes, USA
    • Year and Date
      2010-06-09
    • Related Report
      2011 Final Research Report
  • [Presentation] Interactive hashing and BB84 states2010

    • Author(s)
      T. Koshiba
    • Organizer
      Quantum Information in Paris
    • Place of Presentation
      Paris, France
    • Year and Date
      2010-05-27
    • Related Report
      2011 Final Research Report
  • [Presentation] Interactive Hashing and BB84 states2010

    • Author(s)
      T.Koshiba
    • Organizer
      Quantum Information in Paris
    • Place of Presentation
      Paris, France
    • Year and Date
      2010-05-27
    • Related Report
      2010 Annual Research Report
  • [Presentation] On monotone 'metrics' in the channel spaces (Invited Talk)2010

    • Author(s)
      K. Matsumoto
    • Organizer
      The 5th Workshop ad memoriam of Carlo Novero
    • Place of Presentation
      Turin, Italy
    • Year and Date
      2010-05-26
    • Related Report
      2011 Final Research Report
  • [Presentation] On monotone 'metrics' in the channel spaces (Invited Talk)2010

    • Author(s)
      K.Matsumoto
    • Organizer
      The 5^<th> Workshop ad memoriam of Carlo Novero
    • Place of Presentation
      Turin, Italy
    • Year and Date
      2010-05-26
    • Related Report
      2010 Annual Research Report
  • [Presentation] Perfect quantum network coding with free classical communication2010

    • Author(s)
      H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
    • Organizer
      The 13th Workshop on Quantum InformationProcessing (QIP 2010)
    • Place of Presentation
      Zurich, Switzerland
    • Year and Date
      2010-01-21
    • Related Report
      2011 Final Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [Presentation] Monotone 'metric' in thechannel space: Resource conversionapproach2010

    • Author(s)
      K. Matsumoto
    • Organizer
      The 13th Workshop on QuantumInformation Processing (QIP 2010)
    • Place of Presentation
      Zurich, Switzerland
    • Year and Date
      2010-01-20
    • Related Report
      2011 Final Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [Presentation] Oracularization and two-prover one-round interactive proofs against nonlocal strategies2009

    • Author(s)
      T. Ito, H. Kobayashi, K. Matsumoto
    • Organizer
      The 24th Annual IEEE Conference on Computational Complexity (CCC 2009)
    • Place of Presentation
      Paris, France
    • Year and Date
      2009-07-17
    • Related Report
      2011 Final Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [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
    • Related Report
      2009 Annual Research Report
  • [Book] Handbook of Natural Computing (の中の1章)2011

    • Author(s)
      T.Koshiba, 他多数
    • Publisher
      Springer
    • Related Report
      2010 Annual Research Report

URL: 

Published: 2009-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi