{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:09Z","timestamp":1772283729030,"version":"3.50.1"},"reference-count":19,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T00:00:00Z","timestamp":1518134400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-03882"],"award-info":[{"award-number":["RGPIN-03882"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers. We summarise and, where possible, refine existing RTSs and introduce a new parameter for analysis, called the repair metric. We then explore using secure regenerating codes as RTSs and find them to be immediately applicable. We compare all RTS constructions considered and conclude by presenting the best candidate solutions for when either communication complexity or information rate is prioritised.<\/jats:p>","DOI":"10.1515\/jmc-2017-0058","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T04:15:21Z","timestamp":1523506521000},"page":"57-81","source":"Crossref","is-referenced-by-count":6,"title":["A survey and refinement of repairable threshold schemes"],"prefix":"10.1515","volume":"12","author":[{"given":"Thalia M.","family":"Laing","sequence":"first","affiliation":[{"name":"Security Lab , HP Inc. , Long Down Avenue, Stoke Gifford , Bristol , BS34 8QZ ; and Information Security Group, Royal Holloway University of London, Egham, Surrey, TW20 0EX , United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science , University of Waterloo , Waterloo , ON, N2L 3G1 , Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2018,2,9]]},"reference":[{"key":"2025120600322785802_j_jmc-2017-0058_ref_001_w2aab3b7b5b1b6b1ab1b7b1Aa","doi-asserted-by":"crossref","unstructured":"J. C.  Benaloh,\nSecret sharing homomorphisms: Keeping shares of a secret secret,\nAdvances in Cryptology \u2013 CRYPTO\u2019 86,\nLecture Notes in Comput. Sci. 263\nSpringer, Berlin (1986), 251\u2013260.","DOI":"10.1007\/3-540-47721-7_19"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_002_w2aab3b7b5b1b6b1ab1b7b2Aa","doi-asserted-by":"crossref","unstructured":"G. R.  Blakley,\nSafeguarding cryptographic keys,\nProceedings of the National Computer Conference \u2013 AFIPS,\nTexas A&M University, College Station (1979), 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_003_w2aab3b7b5b1b6b1ab1b7b3Aa","doi-asserted-by":"crossref","unstructured":"G. R.  Blakley and G.  Kabatianski,\nIdeal perfect threshold schemes and MDS codes,\nProceedings of IEEE International Symposium on Information Theory,\nIEEE, Piscataway (1995), 488\u2013488.","DOI":"10.1109\/ISIT.1995.550475"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_004_w2aab3b7b5b1b6b1ab1b7b4Aa","doi-asserted-by":"crossref","unstructured":"B.  Chor and E.  Kushilevitz,\nA communication-privacy tradeoff for modular addition,\nInform. Process. Lett. 45 (1993), no. 4, 205\u2013210.\n10.1016\/0020-0190(93)90120-X","DOI":"10.1016\/0020-0190(93)90120-X"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_005_w2aab3b7b5b1b6b1ab1b7b5Aa","doi-asserted-by":"crossref","unstructured":"A.  Dimakis, P.  Godfrey, Y.  Wu, M.  Wainwright and K.  Ramchandran,\nNetwork coding for distributed storage systems,\nIEEE Trans. Inform. Theory 56 (2010), no. 9, 4539\u20134551.\n10.1109\/TIT.2010.2054295","DOI":"10.1109\/TIT.2010.2054295"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_006_w2aab3b7b5b1b6b1ab1b7b6Aa","doi-asserted-by":"crossref","unstructured":"S.  Goparaju, S.  El Rouayheb, R.  Calderbank and H.  Poor,\nData secrecy in distributed storage systems under exact repair,\nProceedings of International Symposium on Network Coding \u2013 NetCod,\nIEEE, Piscataway (2013), 1\u20136.","DOI":"10.1109\/NetCod.2013.6570831"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_007_w2aab3b7b5b1b6b1ab1b7b7Aa","doi-asserted-by":"crossref","unstructured":"S.  Goparaju, A.  Fazeli and A.  Vardy,\nMinimum storage regenerating codes for all parameters,\nProceedings of IEEE International Symposium on Information Theory \u2013 ISIT\nIEEE, Piscataway (2016), 76\u201380.","DOI":"10.1109\/ISIT.2016.7541264"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_008_w2aab3b7b5b1b6b1ab1b7b8Aa","unstructured":"X.  Guang, J.  Lu and F.  Fu,\nRepairable threshold secret sharing schemes,\npreprint (2014), https:\/\/arxiv.org\/abs\/1410.7190."},{"key":"2025120600322785802_j_jmc-2017-0058_ref_009_w2aab3b7b5b1b6b1ab1b7b9Aa","doi-asserted-by":"crossref","unstructured":"E. D.  Karnin, J. W.  Greene and M. E.  Hellman,\nOn secret sharing systems,\nIEEE Trans. Inform. Theory 29 (1983), no. 1, 35\u201341.\n10.1109\/TIT.1983.1056621","DOI":"10.1109\/TIT.1983.1056621"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_010_w2aab3b7b5b1b6b1ab1b7c10Aa","unstructured":"M.  Nojoumian,\nNovel secret sharing and commitment schemes for cryptographic applications,\nPh.D. thesis, University of Waterloo, 2012."},{"key":"2025120600322785802_j_jmc-2017-0058_ref_011_w2aab3b7b5b1b6b1ab1b7c11Aa","doi-asserted-by":"crossref","unstructured":"M.  Nojoumian, D.  Stinson and M.  Grainger,\nUnconditionally secure social secret sharing scheme,\nIET Inform. Secur. 4 (2010), no. 4, 202\u2013211.\n10.1049\/iet-ifs.2009.0098","DOI":"10.1049\/iet-ifs.2009.0098"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_012_w2aab3b7b5b1b6b1ab1b7c12Aa","doi-asserted-by":"crossref","unstructured":"S.  Pawar, S.  El Rouayheb and K.  Ramchandran,\nOn secure distributed data storage under repair dynamics,\nProceedings of the IEEE Symposium on Information Theory Proceedings \u2013 ISIT,\nIEEE, Piscataway (2010), 2543\u20132547.","DOI":"10.1109\/ISIT.2010.5513795"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_013_w2aab3b7b5b1b6b1ab1b7c13Aa","doi-asserted-by":"crossref","unstructured":"K.  Rashmi, N.  Shah and P.  Kumar,\nOptimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction,\nIEEE Trans. Inform. Theory 57 (2011), no. 8, 5227\u20135239.\n10.1109\/TIT.2011.2159049","DOI":"10.1109\/TIT.2011.2159049"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_014_w2aab3b7b5b1b6b1ab1b7c14Aa","unstructured":"A.  Rawat,\nA note on secure minimum storage regenerating codes,\npreprint (2016), https:\/\/arxiv.org\/abs\/1608.01732."},{"key":"2025120600322785802_j_jmc-2017-0058_ref_015_w2aab3b7b5b1b6b1ab1b7c15Aa","doi-asserted-by":"crossref","unstructured":"N.  Shah, K.  Rashmi and P. V.  Kumar,\nInformation-theoretically secure regenerating codes for distributed storage,\nProceedings of IEEE Global Telecommunications Conference \u2013 GLOBECOM,\nIEEE, Piscataway (2011), 1\u20135.","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_016_w2aab3b7b5b1b6b1ab1b7c16Aa","doi-asserted-by":"crossref","unstructured":"A.  Shamir,\nHow to share a secret,\nCommun. ACM 22 (1979), no. 11, 612\u2013613.\n10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_017_w2aab3b7b5b1b6b1ab1b7c17Aa","unstructured":"D.  Stinson,\nCombinatorial Designs: Constructions and Analysis,\nSpringer, New York, 2004."},{"key":"2025120600322785802_j_jmc-2017-0058_ref_018_w2aab3b7b5b1b6b1ab1b7c18Aa","doi-asserted-by":"crossref","unstructured":"D.  Stinson and R.  Wei,\nCombinatorial repairability for threshold schemes,\nDes. Codes Cryptogr. 86 (2017), no. 1, 1\u201316.","DOI":"10.1007\/s10623-017-0336-6"},{"key":"2025120600322785802_j_jmc-2017-0058_ref_019_w2aab3b7b5b1b6b1ab1b7c19Aa","doi-asserted-by":"crossref","unstructured":"M.  Ye and A.  Barg,\nExplicit constructions of high-rate MDS array codes with optimal repair bandwidth,\nIEEE Trans. Inform. Theory 63 (2017), no. 4, 2001\u20132014.\n10.1109\/TIT.2017.2661313","DOI":"10.1109\/TIT.2017.2661313"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jmc.2018.12.issue-1\/jmc-2017-0058\/jmc-2017-0058.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2017-0058\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2017-0058\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:34:06Z","timestamp":1764981246000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2017-0058\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,9]]},"references-count":19,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,2,9]]},"published-print":{"date-parts":[[2018,3,1]]}},"alternative-id":["10.1515\/jmc-2017-0058"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2017-0058","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"value":"1862-2984","type":"electronic"},{"value":"1862-2976","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2,9]]}}}