Secret sharing (SS) is part of the essential tech-niques in cryptography but still faces many challenges in effi-ciency and security.Currently,SS schemes based on the Chi-nese Remainder Theorem (CRT) are either low in the infor-mation rate or complicated in construction.To solve the above problems,1) a simple construction of an ideal (t,n)-SS scheme is proposed based on CRT for a polynomial ring.Compared with Ning's scheme,it is much more efficient in generating n pairwise coprime modular polynomials during the scheme construction phase.Moreover,Shamir's scheme is also a spe-cial case of our scheme.To further improve the security,2)a common-factor-based (t,n)-SS scheme is proposed in which all shareholders share a common polynomial factor.It enables both the verification of received shares and the establishment of a secure channel among shareholders during the reconstruction phase.As a result,the scheme is resistant to eavesdropping and modification attacks by outside adversaries.

Lei WU;Fuyou MIAO;Keju MENG;Xu WANG

School of Computer Science and Technology,University of Science and Technology of China,Hefei 230026,China

计算机科学前沿

[1]Lei WU;Fuyou MIAO;Keju MENG;Xu WANG-.A simple construction of CRT-based ideal secret sharing scheme and its security extension based on common factor)[J].计算机科学前沿,2022(01):143-151

coprime

simple,CRT,ideal,secret,sharing,its,security,extension,common,Secret,SS,part,essential,tech,niques,cryptography,but,still,faces,many,challenges,ciency,Currently,schemes,Chi,nese,Remainder,Theorem,either,low,infor,mation,rate,complicated,To,solve,above,problems,proposed,Compared,Ning,much,more,efficient,generating,pairwise,modular,polynomials,during,phase,Moreover,Shamir,also,spe,cial,case,our,further,improve,which,shareholders,It,enables,both,verification,received,shares,establishment,secure,channel,among,reconstruction,result,resistant,eavesdropping,modification,attacks,by,outside,adversaries

0.580693