摘要
秘密共享就是将要保管的秘密s提供给一个参与者集合P的所有成员分开保管,当且仅当集合P的一个授权子集中的所有成员出示他们的秘密份额时才能恢复出共享秘密s,而非授权子集成员则得不到关于秘密s的任何信息。本文分别利用有限域上多项式和乘法逆元两种方式作为认证欺骗函数,各构造出一种防欺骗的秘密共享体制,并对其出现欺诈情况的概率给出了讨论和详细的计算结果。
A secret sharing scheme is a method of distributing secret keys among a set of participants P in such a way that qualified subsets of P can reconstruct the value of s,whereas any other(non-qualified)subsets of P cannot determine anything above the value of s.This paper respectively using polyno- mials over a finite field and the multiplicative inverse in two ways as the authentication cheat function. construct two kinds of secret sharing scheme against cheating,structure the anti cheat function,probability and the emergence of fraud on his do discuss and compute the detailed result.
作者
欧海文
倪磊磊
Ou Haiwen;Ni Leilei(Beijing Electron Science and Technology Institute,Beijing 100070,China;Institute of Telecommunication Engineer,Xidian University,Xi'an 71007,shanxi,China)
出处
《北京电子科技学院学报》
2017年第2期1-5,共5页
Journal of Beijing Electronic Science And Technology Institute
关键词
秘密共享
防欺骗
多项式
乘法逆元
2
Institute of Telecommunication Engineer
Xidian University
Xi'an 71007
shanxi
China)