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

• Published in: Chinese Journal of Electronics Vol. 26; no. 2; pp. 313 - 318
• Main Authors: Li, Meng, Yu, Jia, Hao, Rong
• Format: Journal Article
• Language: English
• Published: Published by the IET on behalf of the CIE 01.03.2017
• Subjects: Cellular automata; cellular automata based verifiable multisecret sharing scheme; cryptography; Hash function; linear computational property; linear memory cellular automata; LMCA; Multi‐secret sharing; parallel computational property; security analysis; share verification; Trusted dealer; Verifiability; 元胞自动机; 哈希函数; 安全性分析; 并行计算; 秘密共享方案; 经销商; 计算性能; 验证; Verifiability; Trusted dealer; Hash function; Cellular automata; Multi-secret sharing
• ISSN: 1022-4653; 2075-5597
• DOI: 10.1049/cje.2017.01.026

We proposed a verifiable multi-secret sharing scheme without a dealer.We use cellular automata,having the properties of linear computations and parallel computations,to construct our scheme.The 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 scheme.Hash function is used to realize the verification of shares,which also makes our scheme more efficient.The security of the scheme is also analyzed.