A Secret Sharing Shuffling Scheme Based on Polynomial

摘要：

The threshold protocol based on polynomial needs shuffling scheme to share the secret securely.For avoiding the complexity on communication and operation of the shuffling scheme,this scheme applies brief shuffling algorithm. This paper introduces random order sequence via the dynamic attribute of the feedback time and presents a partial-shuffling scheme.In order to defense the adversary attack against secret sharing process,a kind of dynamic correction mechanism is designed.Performance evaluation shows that the partial-shuffling scheme greatly decreases the secret sharing time and improves the efficiency,while the threshold and the adversary appearance probability are increasing.

关键词： partial shuffling scheme secret sharing dynamic correction mechanism adversary threshold protocol

作者: Xi Zhang Lei Zhang Quan Zhang Chaojing Tang

作者单位: College of Electronic Science and Engineering National University of Defence Technology Changsha,Hunan Province 410073,China

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Onformation and Automation(IEEE 信息与自动化国际会议)

会议地点: 张家界

会议语种:英文

页码: 1746-1750

在线出版日期: 2008-06-20（万方平台首次上网日期，不代表论文的发表时间）