摘要
基于一维细胞自动机和中国剩余定理提出了一个新的多秘密共享方案.该方案将多个秘密打包成一个大秘密,将其作为细胞自动机的一个初始配置;通过对细胞自动机进行反向迭代来重构所共享的秘密.分析表明,该方案实现简单,在计算上是安全的,并且是一个完善的方案.
Based on a one-dimensional cellular automata and the Chinese remainder theorem, a new multi-secret sharing scheme was proposed in this paper. Multiple secrets are packed into one big secret, which is considered as one of the initial configurations of the cellular automata; the backward iteration of the cellular automata is used to recover the shared secrets. Analyses show the proposed scheme can be implemented easily, and is a computationally secure and perfect one.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2006年第6期113-116,共4页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(50479055)
国家973重大项目(G1999035805)
关键词
秘密共享
多秘密共享
细胞自动机
中国剩余定理
secret sharing
multi-secret sharing
cellular automata
Chinese mainder theorem