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

A Study on Cheating Prevention in Secret Sharing Schemes

Research Project

Project/Area Number 24800064
Research Category

Grant-in-Aid for Research Activity Start-up

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionHosei University

Principal Investigator

OBANA Satoshi  法政大学, 情報科学部, 教授 (70633600)

Project Period (FY) 2012-08-31 – 2014-03-31
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2012: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Keywords効率の良い方式提案 / 理論的実現可能性の証明 / 秘密分散法 / 暗号 / 情報セキュリティ
Research Abstract

With respect to secret sharing schemes secure against rushing adversaries who determine their forged shares after observing shares of honest users, we construct four type of schemes secure against rushing adversaries. The sizes of shares of each proposed scheme achieves smallest bit length compared to those of existing schemes with the same security level. Further, we construct a scheme which can detect the fact of cheating and which ensure security whatever an finite field the secret belongs to. We should note that no existing schemes guarantee such a security feature.
With respect to d-multiplicative secret sharing schemes which enable each user to compute a share of a polynomial with degree less than d (where d is a predetermined constant), we clarify conditions with which a secure d-multiplicative scheme (in which no user can cheat the other users) exists. Furthermore, we construct secure and efficient schemes secure against threshold adversary and general adversary, respectively.

Report

(3 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Annual Research Report
  • Research Products

    (6 results)

All 2014 2013

All Journal Article (2 results) Presentation (4 results) (of which Invited: 1 results)

  • [Journal Article] Detection of Cheaters in Non- interactive Polynomial Evalucation2013

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

      IACR Cryptology ePrint Archive

      Volume: 32 Pages: 1-15

    • Related Report
      2013 Final Research Report
  • [Journal Article] Detection of Cheaters in Non-interactive Polynomial Evaluation2013

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

      IACR Cryptology ePrint Archive

      Volume: 2013/032 Pages: 1-15

    • Related Report
      2012 Annual Research Report
  • [Presentation] Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field2014

    • Author(s)
      Satoshi Obana, and Kazuya Tsuchida
    • Organizer
      IWSEC 2014 to Appear
    • Place of Presentation
      青森県 (発表予定)
    • Related Report
      2013 Final Research Report
  • [Presentation] シェアの後出しをする不正者に対して安全な効率のよい秘密分散法2014

    • Author(s)
      尾花賢
    • Organizer
      電子情報通信学会情報セキュリティ研究会
    • Place of Presentation
      名古屋大学
    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Presentation] Detection of Cheaters in Non-interactive Polynomial Evaluation2013

    • Author(s)
      吉田真紀, 尾花賢
    • Organizer
      2013年Compview暗号理論ワークショップ
    • Place of Presentation
      東京工業大学
    • Related Report
      2013 Final Research Report
  • [Presentation] Detection of Cheaters in Non-interactive Polynomial Evaluation2013

    • Author(s)
      吉田真紀,尾花賢
    • Organizer
      2013年 Compview暗号理論ワークショップ
    • Place of Presentation
      東京工業大学(東京都)
    • Related Report
      2012 Annual Research Report
    • Invited

URL: 

Published: 2012-11-27   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi