A simple construction of CRT-based ideal secret sharing scheme and its security extension based on common factor

作     者：Lei WU Fuyou MIAO Keju MENG Xu WANG Lei WU;Fuyou MIAO;Keju MENG;Xu WANG

作者机构：School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei230026China 

出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)

年 卷 期：2022年第16卷第1期

页      面：155-163页

核心收录：

学科分类：0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：This work was supported by National Key R&D Project 2018YFB2100300 the National Natural Science Foundation of China(Grant No.61520106007) 

主　　题：ideal secret sharing Chinese remainder theorem coprime polynomial generation common factor 

摘      要：Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and ***,SS schemes based on the Chinese Remainder Theorem(CRT)are either low in the information rate or complicated in *** solve the above problems,1)a simple construction of an ideal(t,n)-SS scheme is proposed based on CRT for a polynomial *** with Ning’s scheme,it is much more efficient in generating n pairwise coprime modular polynomials during the scheme construction ***,Shamir’s scheme is also a special case of our *** further improve the security,2)a common-factor-based(t,n)-SS scheme is proposed in which all shareholders share a common polynomial *** enables both the verification of received shares and the establishment of a secure channel among shareholders during the reconstruction *** a result,the scheme is resistant to eavesdropping and modification attacks by outside adversaries.