Paper 2016/855

Combinatorial Repairability for Threshold Schemes

Douglas R. Stinson and Ruizhong Wei


In this paper, we consider methods whereby a subset of players in a $(k,n)$-threshold scheme can ``repair'' another player's share in the event that their share has been lost or corrupted. This will take place without the participation of the dealer who set up the scheme. The repairing protocol should not compromise the (unconditional) security of the threshold scheme, and it should be efficient, where efficiency is measured in terms of the amount of information exchanged during the repairing process. We study two approaches to repairing. The first method is based on the ``enrollment protocol'' from (Nojoumian-Stinson-Grainger, 2010) which was originally developed to add a new player to a threshold scheme (without the participation of the dealer) after the scheme was set up.The second method distributes ``multiple shares'' to each player, as defined by a suitable combinatorial design. This method results in larger shares, but lower communication complexity, as compared to the first method.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
secret sharing
Contact author(s)
dstinson @ uwaterloo ca
2016-09-07: received
Short URL
Creative Commons Attribution


      author = {Douglas R.  Stinson and Ruizhong Wei},
      title = {Combinatorial Repairability for Threshold Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2016/855},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.