Combinatorial repairability for threshold schemes
- 290 Downloads
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 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.
KeywordsSecret sharing Threshold scheme Repairability Combinatorial design
Mathematics Subject Classification94A62 94C30 05B05
The first author would like to thank Nabiha Asghar and Charlie Colbourn for helpful comments. The authors’ research was supported by NSERC discovery grants.
- 1.Abel R.J.R., Ge G., Yin J.: Resolvable and near-resolvable designs. In: Colbourn C.J., Dinitz J.H. (eds.) CRC Handbook of Combinatorial Designs, pp. 124–134. Chapman & Hall/CRC, Boca Raton (2007).Google Scholar
- 3.Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: CRYPTO ’88 Proceedings. Lecture Notes in Computer Science, vol. 403, pp. 27–35 (1990).Google Scholar
- 5.Colbourn C., Rosa A.: Triple Systems. Oxford Mathematical Monographs. Oxford University Press, Oxford (1999).Google Scholar
- 8.Guang, X., Lu, J., Fu, F.-W.: Repairable threshold secret sharing schemes (2015). arXiv report arXiv:1410.7190v2.
- 9.Nojoumian, M., Stinson, D.R., Grainger, M.: Unconditionally secure social secret sharing scheme. IET Inf. Secur. 4, 202–211 (2010) (Special issue on multi-agent and distributed information security).Google Scholar
- 10.Nojoumian, M.: Novel secret sharing and commitment schemes for cryptographic applications. PhD thesis, University of Waterloo (2012)Google Scholar