Open AccessA Cellular Automata Based Verifiable Multi‐secret Sharing Scheme Without a Trusted Dealer
Author(s) -
Li Meng,
Yu Jia,
Hao Rong
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2017.01.026
Subject(s) - verifiable secret sharing , scheme (mathematics) , secret sharing , computer science , secure multi party computation , hash function , property (philosophy) , homomorphic secret sharing , shamir's secret sharing , cellular automaton , computation , construct (python library) , theoretical computer science , cryptography , computer security , algorithm , computer network , mathematics , programming language , mathematical analysis , set (abstract data type) , philosophy , epistemology
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.