A secret sharing shuffling scheme based on polynomial
Xi Zhang, Lei Zhang, Quan Zhang, Chaojing Tang · 2008
The threshold protocol based on polynomial needs shuffling scheme to share the secret securely. For avoiding the complexity on communication and operation of the complete-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.