Abstract: In 2010,Harn and Lin proposed the conception of strong t-consistency and designed a strong(n,t,n)verifiable secret sharing scheme,but the scheme has a low efficiency.This paper proposed an efficient strong(n,t,n)verifiable secret sharing scheme.Based on the property of Vandermonde determinant,the scheme can resist and verify the fraud proposed in Harn scheme.Meanwhile,our scheme doesn't need to select the knsub-polynomials.The new scheme with strong t-consistency has the advantage of a low computational complexity.
Publication Year: 2013
Publication Date: 2013-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot