{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:26Z","timestamp":1740148946457,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871019"],"award-info":[{"award-number":["11871019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s12095-024-00695-1","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T08:02:21Z","timestamp":1705478541000},"page":"699-719","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorial constructions of repairable ramp schemes"],"prefix":"10.1007","volume":"16","author":[{"given":"Jinghui","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xiuling","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Zihong","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Advances in Cryptology: Proceedings of CRYPTO\u201988. Lecture Notes in Comput. Sci., vol. 403. pp. 27\u201335 (1990)","key":"695_CR1","DOI":"10.1007\/0-387-34799-2_3"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. Proceedings of the AFIPS 1979 National Computer Conference, New York, 313\u2013317 (1979)","key":"695_CR2","DOI":"10.1109\/MARK.1979.8817296"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Advances in Cryptology: Proceedings of CRYPTO\u201984. Lecture Notes in Comput. Sci., vol. 196. pp. 242\u2013268 (1985)","key":"695_CR3","DOI":"10.1007\/3-540-39568-7_20"},{"unstructured":"Brouwer, A.E.: Steiner triple systems without forbidden subconfigurations. Technical Report ZW 104\/77. Mathematisch Centrum, Amsterdam (1977)","key":"695_CR4"},{"key":"695_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(99)00228-0","volume":"102","author":"YM Chee","year":"2002","unstructured":"Chee, Y.M., Colbourn, C.J., Ling, A.C.H.: Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Appl. Math. 102, 3\u201336 (2002)","journal-title":"Discrete Appl. Math."},{"key":"695_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02986668","volume":"10","author":"CJ Colbourn","year":"1994","unstructured":"Colbourn, C.J., Mendelsohn, E., Rosa, A., \u0160ir\u00e1\u0148, J.: Anti-mitre Steiner triple systems. Graphs Combin. 10, 215\u2013224 (1994)","journal-title":"Graphs Combin."},{"key":"695_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1002\/1520-6610(2000)8:4<300::AID-JCD7>3.0.CO;2-R","volume":"8","author":"MJ Grannell","year":"2000","unstructured":"Grannell, M.J., Griggs, T.S., Whitehead, C.A.: The resolution of the anti-Pasch conjecture. J. Combin. Des. 8, 300\u2013309 (2000)","journal-title":"J. Combin. Des."},{"key":"695_CR8","first-page":"129","volume":"13","author":"TS Griggs","year":"1993","unstructured":"Griggs, T.S., Murphy, J.P.: 101 Anti-Pasch Steiner triple systems of order 19. J. Combin. Math. Combin. Comput. 13, 129\u2013141 (1993)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"695_CR9","first-page":"79","volume":"15","author":"TS Griggs","year":"1990","unstructured":"Griggs, T.S., Murphy, J.P., Phelan, J.S.: Anti-Pasch Steiner triple systems. J. Comb. Inf. Syst. Sci. 15, 79\u201384 (1990)","journal-title":"J. Comb. Inf. Syst. Sci."},{"unstructured":"Guang, X., Lu, J., Fu, F.: Repairable threshold secret sharing schemes, (2014). arXiv:1410.7190v2","key":"695_CR10"},{"issue":"4","key":"695_CR11","doi-asserted-by":"publisher","first-page":"601","DOI":"10.3934\/amc.2019037","volume":"13","author":"B Kacsmar","year":"2019","unstructured":"Kacsmar, B., Stinson, D.R.: A network reliability approach to the analysis of combinatorial repairable threshold schemes. Adv. Math. Commun. 13(4), 601\u2013612 (2019)","journal-title":"Adv. Math. Commun."},{"key":"695_CR12","first-page":"191","volume":"2","author":"TP Kirkman","year":"1847","unstructured":"Kirkman, T.P.: On a problem in combinations. Camb. Dublin Math. J. 2, 191\u2013204 (1847)","journal-title":"Camb. Dublin Math. J."},{"key":"695_CR13","first-page":"287","volume":"7","author":"A Kotzig","year":"1975","unstructured":"Kotzig, A., Lindner, C.C., Rosa, A.: Latin Squares with no subsquares of order two and disjoint Steiner triple systems. Utilitas Math. 7, 287\u2013294 (1975)","journal-title":"Utilitas Math."},{"key":"695_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0012-365X(76)90103-5","volume":"16","author":"A Kotzig","year":"1975","unstructured":"Kotzig, A., Turgeon, J.: On certain constructions for Latin squares with no Latin subsquares of order two. Discrete Math. 16, 263\u2013270 (1975)","journal-title":"Discrete Math."},{"issue":"1","key":"695_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1515\/jmc-2017-0058","volume":"12","author":"TM Laing","year":"2018","unstructured":"Laing, T.M., Stinson, D.R.: A survey and refinement of repairable threshold schemes. J. Math. Cryptol. 12(1), 57\u201381 (2018)","journal-title":"J. Math. Cryptol."},{"key":"695_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1112\/S0024610700008838","volume":"61","author":"ACH Ling","year":"2000","unstructured":"Ling, A.C.H., Colbourn, C.J., Grannell, M.J., Griggs, T.S.: Construction techniques for anti-Pasch Steiner triple systems. J. Lond. Math. Soc. (2) 61, 641\u2013657 (2000)","journal-title":"J. Lond. Math. Soc. (2)"},{"key":"695_CR17","first-page":"41","volume":"8","author":"M McLeish","year":"1975","unstructured":"McLeish, M.: On the existence of Latin Squares with no subsquares of order two. Utilitas Math. 8, 41\u201353 (1975)","journal-title":"Utilitas Math."},{"key":"695_CR18","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-1-4612-3352-7_32","volume-title":"Sequences: Combinatorics, Compression, Security and Transmission","author":"MO Rabin","year":"1990","unstructured":"Rabin, M.O.: The information dispersal algorithm and its applications. In: Capocelli, R.M. (ed.) Sequences: Combinatorics, Compression, Security and Transmission, pp. 406\u2013419. Springer, New York (1990)"},{"key":"695_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"695_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10623-017-0336-6","volume":"86","author":"DR Stinson","year":"2018","unstructured":"Stinson, D.R., Wei, R.: Combinatorial repairability for threshold schemes. Des. Codes Cryptogr. 86, 195\u2013210 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"695_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(98)00204-X","volume":"69","author":"DR Stinson","year":"1999","unstructured":"Stinson, D.R., Wei, R.: An application of ramp schemes to broadcast encryption. Inform. Process. Lett. 69, 131\u2013135 (1999)","journal-title":"Inform. Process. Lett."},{"key":"695_CR22","first-page":"690","volume":"4","author":"W Ogata","year":"1998","unstructured":"Ogata, W., Kurosawa, K.: Some basic properties of general nonperfect secret sharing schemes. J. UCS 4, 690\u2013704 (1998)","journal-title":"J. UCS"},{"unstructured":"Zhang, J.: Three types of combinatorial configurations related to coding theory and cryptography. Hebei Normal University (2019)","key":"695_CR23"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00695-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00695-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00695-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T05:36:35Z","timestamp":1731044195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00695-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,17]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["695"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00695-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,1,17]]},"assertion":[{"value":"1 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors give consent for publication of this work.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}