Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and security.Currently,SS schemes based on the Chinese Remainder Theorem(CRT)are either low in the in...Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and security.Currently,SS schemes based on the Chinese Remainder Theorem(CRT)are either low in the information 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 special 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.展开更多
基金This work was supported by National Key R&D Project 2018YFB2100300the National Natural Science Foundation of China(Grant No.61520106007).
文摘Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and security.Currently,SS schemes based on the Chinese Remainder Theorem(CRT)are either low in the information 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 special 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.
