{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T23:48:33Z","timestamp":1773013713492,"version":"3.50.1"},"reference-count":18,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"vor","delay-in-days":317,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["3122023040"],"award-info":[{"award-number":["3122023040"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301670"],"award-info":[{"award-number":["12301670"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>In this paper, we construct two repairable threshold schemes (RTSs) using a resolvable balanced incomplete block design (RBIBD). First, a resolvable transversal design is given by mutually orthogonal Latin squares. Further, a RBIBD is obtained through the filling hole method, and two repairable key sharing threshold schemes based on the Ramp threshold scheme are constructed based on this design. Finally, the information rate, the repairing degree and the communication complexity of two RTSs are calculated, and the performance of the schemes is analyzed. Compared with the existing schemes, the results show that two schemes constructed in this paper have a higher information rate, a larger repairing degree and lower communication complexity.<\/jats:p>","DOI":"10.1049\/ise2\/7128106","type":"journal-article","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T06:31:01Z","timestamp":1763188261000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Repairable Threshold Key Sharing Schemes Based on Resolvable Balanced Incomplete Block Design"],"prefix":"10.1049","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1991-2352","authenticated-orcid":false,"given":"Xiuli","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9183-9103","authenticated-orcid":false,"given":"Ni","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6329-5909","authenticated-orcid":false,"given":"Yangmei","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_8_2_2","unstructured":"BlaklyG. Safeguard Cryptographic Keys Proceeding of the AFIPS 1979 National Computer Conference 1979 New York AFIPS Press 313\u2013317."},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0401024"},{"key":"e_1_2_8_4_2","first-page":"143","article-title":"Threshold Schemes From Combinatorial Designs","volume":"5","author":"Schellenberg P. J.","year":"1989","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"e_1_2_8_5_2","volume-title":"Combination Construction of Threshold Schemes","author":"Cao H. T.","year":"2022"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00283-8"},{"key":"e_1_2_8_7_2","volume-title":"Combination Design Theory","author":"Shen H.","year":"2008"},{"key":"e_1_2_8_8_2","first-page":"623","article-title":"Combination Construction of Perfect Threshold Scheme","volume":"43","author":"Li M. C.","year":"2013","journal-title":"Chinese Science"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0149-4"},{"key":"e_1_2_8_10_2","unstructured":"GuangX. LuJ. Y. andFuF. W. Repairable Threshold Secret Sharing Schemes 2015 arXiv: 1410.7190v2."},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2009.0098"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0336-6"},{"key":"e_1_2_8_13_2","volume-title":"Handbook of Combinatorial Designs","author":"Colbourn C. J.","year":"2007"},{"key":"e_1_2_8_14_2","volume-title":"Introductory Combinatorics","author":"Richard A. B.","year":"2009"},{"key":"e_1_2_8_15_2","doi-asserted-by":"crossref","unstructured":"YaoA. C.-C. Some Complexity Questions Related to Distributive Computing Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing 1979 Association for Computing Machinery 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"e_1_2_8_16_2","first-page":"83","article-title":"Matrix Approaches to Constructions of Group Divisible Designs","volume":"97","author":"Saurabh S.","year":"2023","journal-title":"Bulletin of the ICA"},{"key":"e_1_2_8_17_2","first-page":"353","article-title":"On the Construction of Balanced Incomplete Block Designs","volume":"9","author":"Bose R. C.","year":"1939","journal-title":"Annals of Human Genetics"},{"key":"e_1_2_8_18_2","unstructured":"WangX. L. JinN. andDengY. M. Research Square According to the Following Link: 2023 https:\/\/www.researchsquare.com\/article\/rs-3062326\/v1."}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/ise2\/7128106","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/ise2\/7128106","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/ise2\/7128106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T22:33:24Z","timestamp":1773009204000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/ise2\/7128106"}},"subtitle":[],"editor":[{"given":"Thomas","family":"Haines","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1049\/ise2\/7128106"],"URL":"https:\/\/doi.org\/10.1049\/ise2\/7128106","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2025-02-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7128106"}}