Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen

08.02.2017 | Ausgabe 1/2018

Designs, Codes and Cryptography 1/2018

Combinatorial repairability for threshold schemes

Designs, Codes and Cryptography > Ausgabe 1/2018
Douglas R. Stinson, Ruizhong Wei
Wichtige Hinweise
Communicated by C. Blundo.


In this paper, we consider methods whereby a subset of players in a (kn)-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 et al. (IET Inf Secur 4: 202–211, 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.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Über diesen Artikel

Weitere Artikel der Ausgabe 1/2018

Designs, Codes and Cryptography 1/2018 Zur Ausgabe

Premium Partner