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

Construction of a Robust Algorithm for Identification of All Malicious Users of a Digital Fingerprinting Code and Characterization of the Joint Capacity

Research Project

Project/Area Number 18K11151
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Review Section Basic Section 60010:Theory of informatics-related
Research InstitutionUniversity of Tsukuba

Principal Investigator

Koga Hiroki  筑波大学, システム情報系, 教授 (20272388)

Project Period (FY) 2018-04-01 – 2022-03-31
Project Status Completed (Fiscal Year 2021)
Budget Amount *help
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2020: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Keywords電子指紋符号 / 結託耐性符号 / 符号化定理 / 容量公式 / 不正者特定 / 同時容量
Outline of Final Research Achievements

Digital fingerprinting codes are used to protect copyrights of digital contents from piracy. In a digital fingerprinting code, we embed a codeword corresponding to a user into a digital content. We need to design a digital fingerprinting code so that we can identify all or a part of malicious users who collude and generate a pirated copy. In this study we investigate the universal simple capacity and the universal joint capacity of a digital fingerprinting code, where these capacities are related to the number of users under which we can use the digital fingerprinting code reliably. We give explicit forms of the universal simple capacity and universal joint capacity under slight modification of the problem. Although the formulas themselves can be found in previous studies, we have given rigorous proofs of the direct parts and the converse parts.

Academic Significance and Societal Importance of the Research Achievements

本研究で導出した電子指紋符号のユニバーサル単純容量およびユニバーサル同時容量の公式は,既存の文献の中にも現れている形ではあるが,既存の文献の中には容量の達成可能性および容量より大きいレートの達成不可能性の厳密な証明の記載はなく,真の意味での容量としての意味は確立されていなかった.本研究では,達成可能性および達成不可能性を厳密に証明したという点で,既存研究とは異なる.本研究の証明において鍵になったのは,電子指紋符号の問題の拡張の他,複数のスコア関数を用いた特定器の構成,仮説検定問題における等式,Sion のミニマックス定理などである.複数のスコア関数を用いた特定器は,実用的にも示唆を与え得る.

Report

(5 results)
  • 2021 Annual Research Report   Final Research Report ( PDF )
  • 2020 Research-status Report
  • 2019 Research-status Report
  • 2018 Research-status Report
  • Research Products

    (9 results)

All 2021 2020 2019 2018

All Journal Article (5 results) (of which Peer Reviewed: 5 results) Presentation (4 results)

  • [Journal Article] Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security2021

    • Author(s)
      K. Sekine and H. Koga
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E104.A Issue: 9 Pages: 1235-1244

    • DOI

      10.1587/transfun.2020DMP0010

    • NAID

      130008081883

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2021-09-01
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Coding Theorems on Digital Fingerprinting Coding under Informed and Uninformed Setups2021

    • Author(s)
      Hiroki Koga
    • Journal Title

      Proceedings of 2021 IEEE Information Theory Workshop (ITW 2021)

      Pages: 1-6

    • DOI

      10.1109/itw48936.2021.9611451

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Coding Theorems on the Simple Capacity for Digital Fingerprinting Codes2020

    • Author(s)
      Hiroki Koga
    • Journal Title

      IEICE Proceeding Series

      Volume: 65 Pages: 61-65

    • DOI

      10.34385/proc.65.A01-13

    • NAID

      230000012551

    • ISSN
      2188-5079
    • Year and Date
      2020-10-18
    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 32020

    • Author(s)
      Yohei Ookawa and Hiroki Koga
    • Journal Title

      Proceedings of 2020 International Symposium on Information Theory

      Pages: 852-857

    • DOI

      10.1109/isit44484.2020.9174121

    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] A Lower Bound on the Joint Capacity of Digital Fingerprinting Codes Using Score Functions Based on Log-Likelihood Ratio2018

    • Author(s)
      Hiroki Koga
    • Journal Title

      Proceedings of 2018 IEEE International Symposium on Information Theory

      Pages: 1136-1140

    • DOI

      10.1109/isit.2018.8437922

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Presentation] 1ビットの秘密情報に対する秘密分散法に同値な条件とその拡張2021

    • Author(s)
      岡村亮,古賀弘樹
    • Organizer
      電子情報通信学会 情報理論研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] 電子指紋符号の同時ユニバーサル容量の下界の導出2019

    • Author(s)
      古賀弘樹
    • Organizer
      第11回シャノン理論ワーウショップ
    • Related Report
      2019 Research-status Report
  • [Presentation] 電子指紋符号の単純容量に関する符号化定理2019

    • Author(s)
      古賀弘樹
    • Organizer
      電子情報通信学会情報理論研究会
    • Related Report
      2019 Research-status Report
  • [Presentation] 混合型の攻撃に対する電子指紋符号の同時容量の評価2018

    • Author(s)
      關根達也,古賀弘樹
    • Organizer
      電子情報通信学会情報理論研究会
    • Related Report
      2018 Research-status Report

URL: 

Published: 2018-04-23   Modified: 2023-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi