Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme

In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will reduce the problem of secret recovery to the polynomial reconstruction problem which can be solved using a recent algorithm by Guruswami and Sudan. In addition to be dealer-free, our protocol does not increase the communication cost between the dealer and the n participants when compared to the original (t, n)-threshold scheme. Despite an increase of the asymptotic time complexity at the combiner, we show that recovering the secret from the output of the previous polynomial reconstruction algorithm is still realistic even for large values of t. Furthermore the scheme does not require every share to be authenticated before being processed by the combiner. This will enable us to reduce the number of elements to be publicly known to recover the secret to one digest produced by a collision resistant hash function w...

• Type: Conference
• Year: 2006
• Where: CISC
• Authors: Christophe Tartary, Huaxiong Wang
• Keywords: CISC 2006, Cryptology, N)-threshold Scheme, Polynomial Reconstruction, Polynomial Reconstruction Problem