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

Optimal Secret Sharing for Proactive Access Structures

Research Project

Project/Area Number 19K11835
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Review Section Basic Section 60010:Theory of informatics-related
Research InstitutionNational Institute of Information and Communications Technology

Principal Investigator

Yoshida Maki  国立研究開発法人情報通信研究機構, サイバーセキュリティ研究所, 主任研究員 (50335387)

Project Period (FY) 2019-04-01 – 2024-03-31
Project Status Completed (Fiscal Year 2023)
Budget Amount *help
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2021: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2020: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Keywords秘密分散 / 最適 / アクセス構造 / 通信複雑度 / 最適化 / 更新 / ハイブリッド / 必要十分 / 暗号資産
Outline of Research at the Start

暗号資産の鍵管理システムが攻撃されても,被害を局所化・無効化するため,
(a) セキュリティレベルの更新を可能にするアクセス構造を備えた秘密分散を定義し,
(b) 暗号応用に不可欠なシェア上の各種特性を担保する更新手法を構築,
(c) 実応用に不可欠なシェアサイズの最小化を達成する最適な秘密分散手法を構築する.
これにより,秘密分散の暗号応用における理論限界の解明という学術面と,実応用における被害状況に応じたセキュリティ強化という社会面の両方で寄与する.

Outline of Final Research Achievements

Based on the previous definition of secret sharing and the major requirements of cryptographic applications, we extended the definition so that an access structure allows updating of the security level including not only the monotonous structures but also non-monotone access structures. This expands the range of cryptographic applications. Expanded. We also confirmed the feasibility of optimality in conventional and new cryptographic applications while ensuring important properties (correctness and verifiability) and essential properties for cryptographic applications.

Academic Significance and Societal Importance of the Research Achievements

本研究の学術的意義は,暗号応用に不可欠な各種特性の担保とシェアサイズの最小化の達成である.社会的意義は,それにより秘密鍵を復元することなく分散したままで電子署名や秘密計算など処理が可能になり,秘密鍵が晒されるリスクを削減したことである.

Report

(6 results)
  • 2023 Annual Research Report   Final Research Report ( PDF )
  • 2022 Research-status Report
  • 2021 Research-status Report
  • 2020 Research-status Report
  • 2019 Research-status Report
  • Research Products

    (12 results)

All 2024 2023 2022 2021 2020 2019

All Journal Article (6 results) (of which Peer Reviewed: 4 results,  Open Access: 1 results) Presentation (6 results) (of which Int'l Joint Research: 2 results,  Invited: 1 results)

  • [Journal Article] Hybrid Multiplicative Non-perfect Secret Sharing2022

    • Author(s)
      Maki Yoshida
    • Journal Title

      2022 IEEE International Symposium on Information Theory (ISIT)

      Volume: 1 Pages: 649-653

    • DOI

      10.1109/isit50566.2022.9834640

    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Journal Article] 秘密同時メッセージと条件付き秘密開示に対する乱数長下界2021

    • Author(s)
      河内 亮周, 吉田 真紀
    • Journal Title

      2021年暗号と情報セキュリティシンポジウム予稿集

      Volume: -

    • Related Report
      2020 Research-status Report
  • [Journal Article] Compact Verifiably Multiplicative Secret Sharing2020

    • Author(s)
      Maki Yoshida, Satoshi Obana
    • Journal Title

      IEICE Proceeding Series

      Volume: 65 Pages: 437-441

    • DOI

      10.34385/proc.65.C03-4

    • NAID

      230000012690

    • ISSN
      2188-5079
    • Year and Date
      2020-10-18
    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing2020

    • Author(s)
      Satoshi Obana, Maki Yoshida
    • Journal Title

      Proceedings of the 17th International Joint Conference on e-Business and Telecommunications

      Volume: II Pages: 322-329

    • DOI

      10.5220/0009819203220329

    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] Verifiably Multiplicative Secret Sharing2019

    • Author(s)
      Maki Yoshida, Satoshi Obana
    • Journal Title

      IEEE Transactions on Information Theory

      Volume: 65 Issue: 5 Pages: 3233-3245

    • DOI

      10.1109/tit.2018.2886262

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] 検証可能な乗法秘密分散の効率向上2019

    • Author(s)
      吉田真紀, 尾花賢
    • Journal Title

      コンピュータセキュリティシンポジウム2019 (CSS2019)予稿集

      Volume: 2F3-2 Pages: 1-5

    • NAID

      170000181091

    • Related Report
      2019 Research-status Report
  • [Presentation] 非対話型秘密計算の通信量2024

    • Author(s)
      吉田 真紀
    • Organizer
      2023年度冬のLAシンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs2024

    • Author(s)
      Maki Yoshida
    • Organizer
      IEEE International Symposium on Information Theory (ISIT 2024)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] On the Communication Complexity of Private Function Sharing and Computation2023

    • Author(s)
      Maki Yoshida
    • Organizer
      IEEE International Symposium on Information Theory (ISIT 2023)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 秘密同時通信と条件付き秘密開示に対する乱数複雑度2022

    • Author(s)
      河内 亮周, 吉田 真紀
    • Organizer
      2021年度冬のLAシンポジウム
    • Related Report
      2021 Research-status Report
  • [Presentation] 秘密分散の最適性について2021

    • Author(s)
      吉田真紀
    • Organizer
      第20回情報科学技術フォーラム(FIT2021)トップカンファレンスセッション
    • Related Report
      2021 Research-status Report
    • Invited
  • [Presentation] Private Simultaneous Messages および Conditional Disclosure of Secrets に関する情報理論的下界2020

    • Author(s)
      河内亮周, 吉田真紀
    • Organizer
      2019年度冬のLAシンポジウム
    • Related Report
      2019 Research-status Report

URL: 

Published: 2019-04-18   Modified: 2025-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi