A Cellular Automata Based Verifiable Multi‐secret Sharing Scheme Without a Trusted Dealer. Issue 2 (1st March 2017)

• Record Type: Journal Article
• Authors: Li, Meng; Yu, Jia; Hao, Rong
• Is Part Of: Chinese journal of electronics. Volume 26:Issue 2(2017)
• Page Start: 313
• Page End: 318
• Publication Date: 2017-03-01
• Subjects: Multi‐secret sharing -- Verifiability -- Trusted dealer -- Cellular automata -- Hash function; cellular automata -- cryptography; cellular automata based verifiable multisecret sharing scheme -- trusted dealer -- linear computational property -- parallel computational property -- share verification -- security analysis -- hash function -- linear memory cellular automata -- LMCA; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2017.01.026
• Languages: English
• ISSNs: 1022-4653

Abstract

Abstract : 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.