乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T05:18:31Z","timestamp":1663651111175},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871363"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10623-022-01092-6","type":"journal-article","created":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T12:03:07Z","timestamp":1661428987000},"page":"2491-2515","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinational constructions of splitting authentication codes with perfect secrecy"],"prefix":"10.1007","volume":"90","author":[{"given":"Lijun","family":"Ji","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8077-940X","authenticated-orcid":false,"given":"Miao","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Yanting","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,25]]},"reference":[{"issue":"3","key":"1092_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s001459900049","volume":"12","author":"C Blundo","year":"1999","unstructured":"Blundo C., De Santis A., Kurosawa K., Ogata W.: On a fallacious bound for authentication codes. J. Cryptol. 12(3), 155\u2013159 (1999).","journal-title":"J. Cryptol."},{"key":"1092_CR2","first-page":"175","volume":"58","author":"EF Brickell","year":"1987","unstructured":"Brickell E.F., Wei V.K.: Optical orthogonal codes and cyclic block designs. Congr. Numer. 58, 175\u2013192 (1987).","journal-title":"Congr. Numer."},{"issue":"3","key":"1092_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"FPK Chung","year":"1989","unstructured":"Chung F.P.K., Salehi J.A., Wei V.K.: Optical orthogonal codes: design, analysis, and applications. IEEE Trans. Inf. Theory 35(3), 595\u2013604 (1989).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1092_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0097-3165(92)90099-G","volume":"59","author":"CJ Colbourn","year":"1992","unstructured":"Colbourn C.J., Hoffman D.G., Rees R.: A new class of group divisible design with block size three. J. Comb. Theory Ser A 59(1), 73\u201389 (1992).","journal-title":"J. Comb. Theory Ser A"},{"key":"1092_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00196910","volume":"3","author":"M De Soete","year":"1991","unstructured":"De Soete M.: New bounds and constructions for authentication\/secrecy codes with splitting. J. Cryptol. 3, 173\u2013186 (1991).","journal-title":"J. Cryptol."},{"issue":"2","key":"1092_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s11766-007-0205-6","volume":"22","author":"B Du","year":"2007","unstructured":"Du B.: Existence of optimal strong partially balanced design. Appl. Math. J. Chin. Univ. Ser. B 22(2), 169\u2013173 (2007).","journal-title":"Appl. Math. J. Chin. Univ. Ser. B"},{"key":"1092_CR7","first-page":"255","volume-title":"The CRC Handbook of Combinatorial Designs","author":"G Ge","year":"2007","unstructured":"Ge G.: Group Divisible Designs. In: Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, pp. 255\u2013260. CRC Press, Boca Raton (2007)."},{"key":"1092_CR8","first-page":"15","volume":"89","author":"M Liang","year":"2012","unstructured":"Liang M., Du B.: Existence of optimal restricted strong partially balanced designs. Util. Math. 89, 15\u201331 (2012).","journal-title":"Util. Math."},{"issue":"3","key":"1092_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s12095-015-0179-9","volume":"9","author":"M Liang","year":"2017","unstructured":"Liang M., Ji L., Zhang J.: Some new classes of $$2$$-fold optimal or perfect splitting authentication codes. Cryptogr. Commun. 9(3), 407\u2013430 (2017).","journal-title":"Cryptogr. Commun."},{"issue":"1\u20133","key":"1092_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0012-365X(03)00283-8","volume":"279","author":"W Ogata","year":"2004","unstructured":"Ogata W., Kurosawa K., Stinson D.R., Saido H.: New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279(1\u20133), 383\u2013405 (2004).","journal-title":"Discret. Math."},{"issue":"1","key":"1092_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1515\/jmc-2019-0048","volume":"15","author":"MB Paterson","year":"2020","unstructured":"Paterson M.B., Stinson D.R.: On the equivalence of authentication codes and robust (2,2)-threshold schemes. J. Math. Cryptol. 15(1), 179\u2013196 (2020).","journal-title":"J. Math. Cryptol."},{"key":"1092_CR12","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2021054","author":"MB Paterson","year":"2021","unstructured":"Paterson M.B., Stinson D.R.: Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes. Adv. Math. Commun. (2021). https:\/\/doi.org\/10.3934\/amc.2021054.","journal-title":"Adv. Math. Commun."},{"key":"1092_CR13","doi-asserted-by":"crossref","unstructured":"Pei D., Li Y., Wang Y., Safavi-Naini R.: Characterization of optimal authentication codes with arbitration. Lecture Notes in Computer Science, vol. 1587, pp. 303\u2013313. Springer, Berlin (1999).","DOI":"10.1007\/3-540-48970-3_25"},{"key":"1092_CR14","doi-asserted-by":"crossref","unstructured":"Rolf S.: Rees: two new direct product-type constructions for resolvable group-divisible designs. J. Comb. Des. 1(1), 15\u201326 (1993).","DOI":"10.1002\/jcd.3180010104"},{"key":"1092_CR15","first-page":"413","volume":"34","author":"GJ Simmons","year":"1982","unstructured":"Simmons G.J.: A game theory model of digital message authentication. Congr. Numer. 34, 413\u2013424 (1982).","journal-title":"Congr. Numer."},{"key":"1092_CR16","first-page":"161","volume":"45","author":"GJ Simmons","year":"1984","unstructured":"Simmons G.J.: Message authcntucation: a game on hypergraphs. Congr. Numer. 45, 161\u2013192 (1984).","journal-title":"Congr. Numer."},{"key":"1092_CR17","doi-asserted-by":"crossref","unstructured":"Simmons G.J.: Authentucation theorey\/coding theory. In: Blakley G.R., Chaum D. (eds.) Advances in Cryptology-CRYPTO 1984, vol. 196, pp. 411\u2013431. Lecture Notes in Computer Science. Springer, Berlin (1985).","DOI":"10.1007\/3-540-39568-7_32"},{"key":"1092_CR18","first-page":"379","volume-title":"Contemporary Cryptology: The Science of Information Integrity","author":"GJ Simmons","year":"1992","unstructured":"Simmons G.J.: A survey of information authentication. In: Simmons G.J. (ed.) Contemporary Cryptology: The Science of Information Integrity, pp. 379\u2013419. IEEE Press, Piscataway (1992)."},{"issue":"1","key":"1092_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02252868","volume":"2","author":"DR Stinson","year":"1990","unstructured":"Stinson D.R.: The combinatorics of authentication and secrecy codes. J. Cryptol. 2(1), 23\u201349 (1990).","journal-title":"J. Cryptol."},{"key":"1092_CR20","first-page":"550","volume-title":"The CRC Handbook of Combinatorial Designs","author":"DR Stinson","year":"2007","unstructured":"Stinson D.R., Wei R., Yin J.: Packings. In: Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, pp. 550\u2013556. CRC Press, Boca Raton (2007)."},{"issue":"3","key":"1092_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10623-005-1501-x","volume":"38","author":"J Wang","year":"2006","unstructured":"Wang J.: A new class of optimal $$3$$-splitting authentication codes. Des. Codes Cryptogr. 38(3), 373\u2013381 (2006).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1092_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/jcd.21336","volume":"22","author":"H Wei","year":"2014","unstructured":"Wei H., Ge G.: Group divisible designs with block size four and group type $$g^um^1$$ for $$g\\equiv 0$$ mod $$6$$. J. Comb. Des. 22(1), 26\u201352 (2014).","journal-title":"J. Comb. Des."},{"key":"1092_CR23","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0097-3165(72)90029-5","volume":"13","author":"RM Wilson","year":"1972","unstructured":"Wilson R.M.: An existence theory for pairwise balanced designs II. The structure of PBD closed sets and the existence conjectures. J. Comb. Theory A 13, 246\u2013273 (1972).","journal-title":"J. Comb. Theory A"},{"key":"1092_CR24","unstructured":"Wilson R.M.: Constructions and uses of pairwise balanced designs in Hall M., Van Lint J H (eds.). Combinatorics, Part 1. Mathematisch Centrun Tracts. vol. 55, pp. 18\u201341. Amsterdam:[s.n.] (1974)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01092-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01092-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01092-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T17:16:21Z","timestamp":1663607781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01092-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,25]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1092"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01092-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,25]]},"assertion":[{"value":"17 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}