基于二元多项式与中国剩余定理的多秘密分享方案

摘要

在基于单向函数和二元多项式的秘密分享方案的基础上，利用中国剩余定理构造了一个（t ＋1，n ）门限可验证的多秘密分享方案。这个方案便于成员加入和系统的更新。%Based on the scheme based on the one -way function and bivariate polynomial ,this paper utilizes the Chinese Remainder Theorem to build a verifiable multi -secret sharing scheme with a threshold of (t +1,n)which is convenient for enrolling new members and updating system.