{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:25Z","timestamp":1759063765427,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,8,4]],"date-time":"2015-08-04T00:00:00Z","timestamp":1438646400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61170301"],"award-info":[{"award-number":["61170301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61170301"],"award-info":[{"award-number":["61170301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11450110409"],"award-info":[{"award-number":["11450110409"]}],"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":[[2016,9]]},"DOI":"10.1007\/s10623-015-0123-1","type":"journal-article","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T03:47:55Z","timestamp":1438573675000},"page":"635-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Latin square autotopism secret sharing scheme"],"prefix":"10.1007","volume":"80","author":[{"given":"Rebecca J.","family":"Stones","sequence":"first","affiliation":[]},{"given":"Ming","family":"Su","sequence":"additional","affiliation":[]},{"given":"Xiaoguang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"123_CR1","unstructured":"Blakey G.R.: Safeguarding cryptographic keys. In: Proceedings of NCC, vol. 48, pp. 313\u2013317 (1979)."},{"key":"123_CR2","doi-asserted-by":"crossref","unstructured":"Browning J., Stones D.S., Wanless I.M.: Bounds on the number of autotopisms and subsquares of a Latin square. Combinatorica 33, 11\u201322 (2013).","DOI":"10.1007\/s00493-013-2809-1"},{"key":"123_CR3","doi-asserted-by":"crossref","unstructured":"Cameron P.J.: Permutation Groups. Cambridge University Press, Cambridge (1999).","DOI":"10.1017\/CBO9780511623677"},{"key":"123_CR4","doi-asserted-by":"crossref","unstructured":"Cavenagh N.J.: A superlinear lower bound for the size of a critical set in a Latin square. J. Combin. Des. 15(4), 269\u2013282 (2007).","DOI":"10.1002\/jcd.20152"},{"key":"123_CR5","unstructured":"Chaudhry G., Seberry J.: Secret sharing schemes based on room squares. In: Proceedings of DMTCS \u201996\u2014Combinatorics, Complexity and Logic, pp. 158\u2013167 (1996)."},{"key":"123_CR6","unstructured":"Chaudhry G., Ghodosi H., Seberry J.: Perfect secret sharing schemes from room squares. J. Comb. Math. Comb. Comput. 28, 55\u201361 (1998)."},{"key":"123_CR7","doi-asserted-by":"crossref","unstructured":"Chum C.S., Zhang X.: The Latin squares and the secret sharing schemes. Groups Complex. Cryptol. 2(2), 175\u2013202 (2010).","DOI":"10.1515\/gcc.2010.011"},{"key":"123_CR8","unstructured":"Chum C.S., Zhang X.: Improved Latin square based secret sharing scheme. Comput. Comb. Group Theory Cryptogr. 582, 51\u201364 (2012)."},{"key":"123_CR9","doi-asserted-by":"crossref","unstructured":"Colbourn C.J.: The complexity of completing partial Latin squares. Discret. Appl. Math. 8(1), 25\u201330 (1984).","DOI":"10.1016\/0166-218X(84)90075-1"},{"key":"123_CR10","unstructured":"Cooper J., Donovan D., Seberry J.: Secret sharing schemes arising from Latin squares. Bull. Instrum. Comb. Appl. 12, 33\u201343 (1994)."},{"key":"123_CR11","unstructured":"Donovan D.M., Lefevre J.G., McCourt T.A., Cavenagh N.J., Khodkar A.: Identifying flaws in the security of critical sets in Latin squares via triangulations. Australas. J. Comb. 52, 243\u2013268 (2012)."},{"key":"123_CR12","unstructured":"Fitina L.F., Lal S.P.: Access schemes based on perfect critical set partitions and transformations. Australas. J. Comb. 34, 229\u2013237 (2006)."},{"key":"123_CR13","unstructured":"Gamble G., Maenhaut B.M., Seberry J., Street A.P.: Further results on strongbox secured secret sharing schemes. Util. Math. 66, 165\u2013193 (2004)."},{"key":"123_CR14","unstructured":"Ganfornina R.M.F.: Decomposition of principal autotopisms into triples of a Latin square. In: Book of Abstracts of the Tenth Meeting on Computer Algebra and Applications, pp. 95\u201398 (2006)."},{"key":"123_CR15","unstructured":"Ganfornina R.M.F.: Latin squares associated to principal autotopisms of long cycles. Application in cryptography. In: Proceedings of Transgressive Computing, pp. 213\u2013230 (2006)."},{"key":"123_CR16","doi-asserted-by":"crossref","unstructured":"Grannell M.J., Griggs T.S., Street A.P.: A flaw in the use of minimal defining sets for secret sharing schemes. Des. Codes Cryptogr. 40(2), 225\u2013236 (2006).","DOI":"10.1007\/s10623-006-0009-3"},{"key":"123_CR17","doi-asserted-by":"crossref","unstructured":"McKay B.D., Wanless I.M.: On the number of Latin squares. Ann. Comb. 9, 335\u2013344 (2005).","DOI":"10.1007\/s00026-005-0261-7"},{"key":"123_CR18","doi-asserted-by":"crossref","unstructured":"McKay B.D., Meynert A., Myrvold W.: Small Latin squares, quasigroups, and loops. J. Comb. Des. 15, 98\u2013119 (2007).","DOI":"10.1002\/jcd.20105"},{"key":"123_CR19","unstructured":"Seberry J., Street A.P.: Strongbox secured secret sharing schemes. Util. Math. 57, 147\u2013163 (2000)."},{"key":"123_CR20","doi-asserted-by":"crossref","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979).","DOI":"10.1145\/359168.359176"},{"key":"123_CR21","unstructured":"Simmons G.J.: An introduction to shared secret and\/or shared control schemes and their applications. In: Contemporary Cryptology, the Science of Information Integrity, pp. 441\u2013497. IEEE Press, New York (1991)."},{"key":"123_CR22","doi-asserted-by":"crossref","unstructured":"Stinson D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2(4), 357\u2013390 (1992).","DOI":"10.1007\/BF00125203"},{"key":"123_CR23","doi-asserted-by":"crossref","unstructured":"Stones D.S.: The many formulae for the number of Latin rectangles. Electron. J. Comb. 17(A1) (2010).","DOI":"10.1017\/S0004972710000328"},{"key":"123_CR24","unstructured":"Stones D.S.: On the number of Latin rectangles. Ph.D. Thesis, Monash University (2010). http:\/\/arrow.monash.edu.au\/hdl\/1959.1\/167114 ."},{"key":"123_CR25","doi-asserted-by":"crossref","unstructured":"Stones D.S.: The parity of the number of quasigroups. Discret. Math. 310(21), 3033\u20133039 (2010).","DOI":"10.1016\/j.disc.2010.06.027"},{"key":"123_CR26","doi-asserted-by":"crossref","unstructured":"Stones D.S., Vojt\u011bchovsk\u00fd P., Wanless I.M.: Cycle structure of autotopisms of quasigroups and Latin squares. J. Comb. Des. 20, 227\u2013263 (2012).","DOI":"10.1002\/jcd.20309"},{"key":"123_CR27","unstructured":"Tompa M., Woll H.: How to share a secret with cheaters. IBM Res. Rep. RC 11840 (Log #52910) (1986)."},{"key":"123_CR28","unstructured":"Wikipedia: Rule of three (statistics). http:\/\/en.wikipedia.org\/wiki\/Rule_of_three_(statistics) . Accessed July 2014."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0123-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0123-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0123-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T20:39:58Z","timestamp":1567024798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0123-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,4]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0123-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2015,8,4]]}}}