size | type | expected number |
2 | $ 3(r_2-1)^2 p^2 $ | |
3 | pair-pair-pair | $ 4(r_2-1)^3 p^3 $ |
3 | pair-pair-point | $ 12(r_2-1)^2(r_1-3r_2+2) p^3 $ |
3 | pair-point-point | $ 6(r_2-1)(r_1-3r_2+2)^2 p^3 $ |
4 | $ (r_1-3r_2+2)^4 p^4 $ |
A repairable threshold scheme (which we abbreviate to RTS) is a $ (\tau,n) $-threshold scheme in which a subset of players 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. Combinatorial repairable threshold schemes (or combinatorial RTS) were recently introduced by Stinson and Wei [
Citation: |
Table 1.
Expected number of repair sets for
size | type | expected number |
2 | $ 3(r_2-1)^2 p^2 $ | |
3 | pair-pair-pair | $ 4(r_2-1)^3 p^3 $ |
3 | pair-pair-point | $ 12(r_2-1)^2(r_1-3r_2+2) p^3 $ |
3 | pair-point-point | $ 6(r_2-1)(r_1-3r_2+2)^2 p^3 $ |
4 | $ (r_1-3r_2+2)^4 p^4 $ |
[1] | J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Lecture Notes in Computer Science, 403 (1990), 27-35 (CRYPTO '88 Proceedings). doi: 10.1007/0-387-34799-2_3. |
[2] | C. J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, 1987. |
[3] | C. J. Colbourn and J. H. Dinitz, Handbook of Combinatorial Designs, Second Edition, Chapman & Hall/CRC, Boca Raton, FL, 2007. |
[4] | B. Kacsmar, Designing Efficient Algorithms for Combinatorial Repairable Threshold Schemes, Masters Thesis, University of Waterloo, 2018. |
[5] | T. M. Laing and D. R. Stinson, A survey and refinement of repairable threshold schemes, Journal of Mathematical Cryptology, 12 (2018), 57-81. doi: 10.1515/jmc-2017-0058. |
[6] | A. Shamir, How to share a secret, Communications of the ACM, 22 (1979), 612-613. doi: 10.1145/359168.359176. |
[7] | D. R. Stinson and M. B. Paterson, Cryptography. Theory and Practice, Chapman & Hall/CRC, Boca Raton, 2019. |
[8] | D. R. Stinson and R. Wei, Combinatorial repairability for threshold schemes, Designs, Codes and Cryptography, 86 (2018), 195-210. doi: 10.1007/s10623-017-0336-6. |