%0 Journal Article
%T A Multi-secret Sharing Scheme Based on Cellular Automata<br>一个基于细胞自动机的多秘密共享方案
%A LI Hui-xian
%A CHENG Chun-tian
%A PANG Liao-jun
%A <br>李慧贤
%A 程春田
%A 庞辽军
%J 系统工程理论与实践
%D 2006
%I 
%X 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.
%K secret sharing
%K multi-secret sharing
%K cellular automata
%K Chinese remainder theorem<br>秘密共享
%K 多秘密共享
%K 细胞自动机
%K 中国剩余定理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=80DB9E254D0A13A0&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=A63576421B012172&eid=8477411EEDB08A86&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=14