A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer

作     者：LI Meng YU Jia HAO Rong 

作者机构：College of Computer Science and TechnologyQingdao University Shandong Provincial Key Laboratory of Computer Network 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2017年第26卷第2期

页      面：313-318页

核心收录：

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

基　　金：supported by the National Natural Science Foundation of China(No.61572267,No.61272425,No.61402245) Shandong provincial Key Laboratory of Computer Network(No.SDKLCN-2013-03) PAPD and CICAEET 

主　　题：Multi-secret sharing Verifiability Trusted dealer Cellular automata Hash function 

摘      要：We proposed a verifiable multi-secret sharing scheme without a *** use cellular automata,having the properties of linear computations and parallel computations,to construct our *** linear computational property makes it possible to build a scheme without the assistance of a trusted dealer,and the parallel computational property contributes to the high efficiency of the *** function is used to realize the verification of shares,which also makes our scheme more *** security of the scheme is also analyzed.