• DocumentCode
    1802624
  • Title

    Ideal Perfect Multilevel Threshold Secret Sharing Scheme

  • Author

    Lin, Changlu ; Harn, Lein ; Ye, Dingfeng

  • Author_Institution
    Key Lab. of Network Security & Cryptology, Fujian Normal Univ., Fuzhou, China
  • Volume
    2
  • fYear
    2009
  • fDate
    18-20 Aug. 2009
  • Firstpage
    118
  • Lastpage
    121
  • Abstract
    Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir´s scheme is ideal and perfect. In this paper, we propose two modifications of Shamir´s secret sharing scheme. In our first modification, each shareholder keeps both x-coordinate and y-coordinate of a polynomial as private share. In our second modification, dealer uses polynomial with degree larger than the threshold value t to generate shares for a (t, n) threshold scheme. We show that these two modified schemes are ideal and perfect. Using these two modifications, we design a multilevel threshold secret sharing schemes (MTSS). We prove that the proposed scheme is secure.
  • Keywords
    cryptography; Shamir secret sharing scheme; ideal perfect secret sharing; multilevel threshold secret sharing; Cities and towns; Communication system security; Computer science; Computer science education; Computer security; Cryptography; Information security; Information systems; Laboratories; Polynomials; Secret sharing; multilevel threshold secret sharing; threshold;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Assurance and Security, 2009. IAS '09. Fifth International Conference on
  • Conference_Location
    Xian
  • Print_ISBN
    978-0-7695-3744-3
  • Type

    conf

  • DOI
    10.1109/IAS.2009.279
  • Filename
    5283231