文献类型：期刊文献

英文题名：General multi-secret sharing scheme for cheat-proof

作者：Gan, Yuan-Ju[1]; Xie, Shi-Yi[1]; Fu, Dong-Yang[1]; Li, Xiao-Li[1]

机构：[1] School of Information, Guangdong Ocean University, Zhanjiang 524088, China

年份：2008

卷号：37

期号：1

起止页码：68

外文期刊名：Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China

收录：EI(收录号：20081911244303)

语种：英文

外文关键词：Functions - Parallel algorithms - Security of data

外文摘要：The most present threshold multi-secret sharing schemes cannot efficiently solve the problem that a participant is dynamic added or deleted. In this study, an efficient multi-secret sharing scheme is designed with general access structure based on the intractability of reversing the one-way Hash function and solving the discrete logarithm problem. The proposed scheme has the following properties: cheating of the dealer or any participant can be detected efficiently; two public parameters of a new secret would be published by the dealer; the participants reconstruct a secret with parallel procedure in a secret recovery phase; and the shadows of other participants would not change when the system accepts a new participant or fires an old participant.