Presentation 2003/3/19
Threshold-Verifiable Secret Sharing Scheme
Raylin TSO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Verifiable secret sharing schemes provide protection against dealer's cheating. In this paper, two thresh-old-verifiable secret sharing schemes are proposed. These schemes allow the participants to verify whether the threshold is exactly the same as being claimed by the dealer. Thses improve a method described by Benaloh in [1] and solve a problem mentioned by Laih, Harn and Chang [7].
Keyword(in Japanese) (See Japanese page)
Keyword(in English) dealer's cheating / Lagrange interpolation / secret sharing scheme / Shamir's (t,n)-threshold scheme / threshold-verifiable
Paper # IT2002-52,ISEC2002-110,SST2002-158,ITS2002-135
Date of Issue

Conference Information
Committee ISEC
Conference Date 2003/3/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Threshold-Verifiable Secret Sharing Scheme
Sub Title (in English)
Keyword(1) dealer's cheating
Keyword(2) Lagrange interpolation
Keyword(3) secret sharing scheme
Keyword(4) Shamir's (t,n)-threshold scheme
Keyword(5) threshold-verifiable
1st Author's Name Raylin TSO
1st Author's Affiliation Risk Engineering Major, Graduate School of Systems and Information Engineering University of Tsukuba()
Date 2003/3/19
Paper # IT2002-52,ISEC2002-110,SST2002-158,ITS2002-135
Volume (vol) vol.102
Number (no) 743
Page pp.pp.-
#Pages 4
Date of Issue