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

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 deal...

Full description

Saved in:
Bibliographic Details
Published in:电子学报：英文版 2017 (2), p.313-318
Main Author: LI Meng YU Jia HAO Rong
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1022-4653