{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:37:09Z","timestamp":1742985429484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834899"},{"type":"electronic","value":"9783031834905"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-83490-5_2","type":"book-chapter","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T06:23:56Z","timestamp":1741760636000},"page":"25-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Block Designs to\u00a0Codes to\u00a0Crypto and\u00a0Back Again"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1329-3514","authenticated-orcid":false,"given":"Diane","family":"Donovan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5945-9575","authenticated-orcid":false,"given":"James","family":"Lefevre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6824-451X","authenticated-orcid":false,"given":"E. \u015eule","family":"Yaz\u0131c\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C Blundo","year":"1995","unstructured":"Blundo, C., De Santis, A., Stinson, D.R., Vaccaro, U.: Graph decompositions and secret sharing schemes. J. Cryptol. 8, 39\u201364 (1995)","journal-title":"J. Cryptol."},{"unstructured":"Brown, L. and Seberry, J.: On the design of permutation $$P$$ in DES type cryptosystems. In: Quisquater, J.J, Vandewalle, J. (eds) Advances in Cryptology - EUROCRYPT \u201989. EUROCRYPT 1989. LNCS, vol. 434. Springer, Berlin, Heidelberg (1990)","key":"2_CR2"},{"unstructured":"Camtepe, S., Dawson, E., Boyen, X.: A combinatorial construct for keyless message dispersal, QUT ePrints (2016). https:\/\/eprints.qut.edu.au\/94441\/","key":"2_CR3"},{"unstructured":"Carter, G., Dawson, E., Nielsen, L.: A Latin square version of DES. In: Proceeding of Workshop of Selected Areas in Cryptography, Ottawa, Canada (1995)","key":"2_CR4"},{"unstructured":"Carter, G., Dawson, E., Nielsen, L.: DESV: a Latin square variation of DES. In: Proceedings of the Workshop on Selected Areas in Cryptography, Ottawa, Canada (1995)","key":"2_CR5"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"P3.15","DOI":"10.37236\/6338","volume":"24","author":"N Cavenagh","year":"2017","unstructured":"Cavenagh, N., Demirkale, F., Donovan, D.: Orthogonal trades in complete sets of MOLS. Electron. J. Comb. 24(3), P3.15 (2017)","journal-title":"Electron. J. Comb."},{"key":"2_CR7","first-page":"29","volume":"1","author":"D Chen","year":"1990","unstructured":"Chen, D., Stinson, D.R.: Recent results on combinatorial constructions for threshold schemes. Australas. J. Comb. 1, 29\u201348 (1990)","journal-title":"Australas. J. Comb."},{"key":"2_CR8","first-page":"33","volume":"12","author":"J Cooper","year":"1994","unstructured":"Cooper, J., Donovan, D., Seberry, J.: Secret Sharing schemes arising from Latin squares. Bull. Inst. Comb. Appl. 12, 33\u201343 (1994)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/9781003040897","volume-title":"CRC Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn, C.J., Dinitz, J.H.: CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2010)"},{"key":"2_CR10","first-page":"209","volume":"17","author":"EP Dawson","year":"1984","unstructured":"Dawson, E.P.: The binary code of the [191,20,2] biplane. Ars Combin. 17, 209\u2013223 (1984)","journal-title":"Ars Combin."},{"unstructured":"Dawson, E.P.: Self-dual ternary codes and Hadamard matrices. ARS Comb. 19(A), 303\u2013308 (1985)","key":"2_CR11"},{"unstructured":"Dawson, E.P.: Relations between codes and designs, Dissertation, University of Queensland (1985)","key":"2_CR12"},{"unstructured":"Dawson, E.P.: Design and cryptanalysis of symmetric ciphers, Dissertation, Queensland University of Technology (1991)","key":"2_CR13"},{"unstructured":"Dawson, E., Donovan, D. and Rahilly, A.: Methods for sharing cryptographic keys. In: Communications\u2019 92: Communications Technology, Services and Systems, pp. 135\u2013139 (1992)","key":"2_CR14"},{"key":"2_CR15","first-page":"27","volume":"8","author":"E Dawson","year":"1993","unstructured":"Dawson, E., Mahmoodian, E.S., Rahilly, A.: Orthogonal arrays and ordered threshold schemes. Australas. J. Comb. 8, 27\u201344 (1993)","journal-title":"Australas. J. Comb."},{"unstructured":"Dawson, E. and Donovan, D.: Shamir\u2019s scheme says it all. In: Proceedings of the IFIP TC11, Ninth International Conference on Information Security: 1993, Computer Security, pp. 91\u2013102 (1993)","key":"2_CR16"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0167-4048(94)90097-3","volume":"13","author":"E Dawson","year":"1994","unstructured":"Dawson, E., Donovan, D.: The breadth of Shamir\u2019s secret-sharing scheme. Comput. Secur. 13(1), 69\u201378 (1994)","journal-title":"Comput. Secur."},{"key":"2_CR18","first-page":"75","volume":"13","author":"E Dawson","year":"1996","unstructured":"Dawson, E., Donovan, D.M., Offer, A.: Quasigroups isotopisms and authentication schemes. Australas. J. Comb. 13, 75\u201388 (1996)","journal-title":"Australas. J. Comb."},{"issue":"3","key":"2_CR19","first-page":"1","volume":"32","author":"F Demirkale","year":"2015","unstructured":"Demirkale, F., Donovan, D., K\u00fc\u00e7\u00fck\u00e7if\u00e7i, S., Yaz\u0131c\u0131, E.\u015e: Orthogonal trades and the intersection problem for orthogonal arrays. Graph. Comb. 32(3), 1\u201310 (2015)","journal-title":"Graph. Comb."},{"issue":"107","key":"2_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0012-365X(92)90543-O","volume":"106","author":"J Denes","year":"1992","unstructured":"Denes, J., Keedwell, A.D.: A new authentication scheme based on Latin squares. Discret. Math. 106(107), 157\u2013161 (1992)","journal-title":"Discret. Math."},{"issue":"5","key":"2_CR21","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1016\/j.dam.2008.04.001","volume":"157","author":"G Di Crescenzo","year":"2009","unstructured":"Di Crescenzo, G., Galdi, C.: Hypergraph decomposition and secret sharing. Discret. Appl. Math. 157(5), 928\u2013946 (2009)","journal-title":"Discret. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Donovan, D,M., Mahmoodian, E., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. Surv. Comb., 115\u2013174 (2003)","key":"2_CR22","DOI":"10.1017\/CBO9781107359970.006"},{"key":"2_CR23","first-page":"243","volume":"52","author":"DM Donovan","year":"2012","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)","journal-title":"Australas. J. Comb."},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00373-010-0882-4","volume":"25","author":"D Donovan","year":"2009","unstructured":"Donovan, D., Lefevre, J., Waterhouse, M., Yaz\u0131c\u0131, E.\u015e: On defining sets of full designs with block size three. Graph. Comb. 25(6), 825\u2013839 (2009)","journal-title":"Graph. Comb."},{"issue":"6","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1088\/0951-7715\/6\/6\/010","volume":"6","author":"K Eloranta","year":"1993","unstructured":"Eloranta, K.: Partially permutive cellular automata. Nonlinearity 6(6), 1009 (1993)","journal-title":"Nonlinearity"},{"doi-asserted-by":"crossref","unstructured":"Fuller, F., Millan W. and Dawson, E.: Multi-objective optimisation of bijective s-boxes. Evol. Comput. CEC2004 2, 1525\u20131532 (2004)","key":"2_CR26","DOI":"10.1109\/CEC.2004.1331077"},{"key":"2_CR27","first-page":"165","volume":"66","author":"G Gamble","year":"2004","unstructured":"Gamble, G., Maenhaut, B.M., Seberry, J., Street, A.P.: Further results on strongbox secured secret sharing schemes. Utilitas Math. 66, 165\u2013193 (2004)","journal-title":"Utilitas Math."},{"unstructured":"Gligoroski, D., Markovski, S., Kocarev, L., Gusev, M.: Edon80. Candidate eStream Phase 3. https:\/\/www.ecrypt.eu.org\/stream\/edon80p3.html. Accessed 4 Jan 2024","key":"2_CR28"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10623-006-0009-3","volume":"40","author":"MJ Grannell","year":"2006","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 Cryptograph 40, 225\u2013236 (2006)","journal-title":"Des. Codes Cryptograph"},{"unstructured":"Havas, G., Lawrence, J.L., Ramsay, C., Street, A.P., Yaz\u0131c\u0131, E.\u015e: Defining set spectra for designs can have arbitrarily large gaps. Utilitas Math. 75, 67\u201381 (2008)","key":"2_CR30"},{"issue":"19","key":"2_CR31","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1049\/el:19941076","volume":"30","author":"J He","year":"1994","unstructured":"He, J., Dawson, E.: Multistage secret sharing based on one-way function. Electron. Lett. 30(19), 1591\u20131592 (1994)","journal-title":"Electron. Lett."},{"issue":"2","key":"2_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1049\/el:19950073","volume":"31","author":"J He","year":"1995","unstructured":"He, J., Dawson, D.: Multisecret-sharing scheme based on one-way function. Electron. Lett. 31(2), 93\u201395 (1995)","journal-title":"Electron. Lett."},{"doi-asserted-by":"crossref","unstructured":"He, J., Dawson, E.: How to fairly reconstruct a shared secret. In: Cryptography: Policy and Algorithms, pp. 115\u2013124 (1996)","key":"2_CR33","DOI":"10.1007\/BFb0032351"},{"doi-asserted-by":"crossref","unstructured":"He, J., Dawson, E.: On the reconstruction of shared secrets. In: Information Systems Security: Facing the Information Society of the 21st Century, pp. 209\u2013218 (1996)","key":"2_CR34","DOI":"10.1007\/978-1-5041-2919-0_18"},{"issue":"3","key":"2_CR35","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1008200702849","volume":"14","author":"J He","year":"1998","unstructured":"He, J., Dawson, E.: Shared secret reconstruction. Des. Codes Crypt. 14(3), 221\u2013237 (1998)","journal-title":"Des. Codes Crypt."},{"doi-asserted-by":"crossref","unstructured":"Hisil, H., Carter, G., Dawson, E: New formulae for efficient elliptic curve arithmetic. In: Progress in Cryptology-INDOCRYPT, pp. 138\u2013151 (2007)","key":"2_CR36","DOI":"10.1007\/978-3-540-77026-8_11"},{"issue":"1","key":"2_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc.2011.005","volume":"5","author":"H Hisil","year":"2011","unstructured":"Hisil, H., Wong, K.K.H., Carter, G., Dawson, E.: An exploration of affine group laws for elliptic curves. J. Math. Cryptol. 5(1), 1\u201350 (2011)","journal-title":"J. Math. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"Hitchcock, Y., Dawson, E., Clark, A., Montague, P.: Implementing an efficient elliptic curve cryptosystem over GF($$p$$) on a smart card. ANZIAM J. 44(E), C354\u2013C377 (2003)","key":"2_CR38","DOI":"10.21914\/anziamj.v44i0.686"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s10207-004-0045-9","volume":"3","author":"Y Hitchcock","year":"2004","unstructured":"Hitchcock, Y., Montague, P., Carter, G., Dawson, E.: The efficiency of solving multiple discrete logarithm problems and the implications for the security of fixed elliptic curves. Int. J. Inf. Secur. 3, 86\u201398 (2004)","journal-title":"Int. J. Inf. Secur."},{"key":"2_CR40","first-page":"51","volume":"14","author":"WA Jackson","year":"1996","unstructured":"Jackson, W.A., Martin, K.M.: A combinatorial interpretation of ramp schemes. Australas. J. Comb. 14, 51\u201360 (1996)","journal-title":"Australas. J. Comb."},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s00373-010-0892-2","volume":"26","author":"E Kolotoglu","year":"2010","unstructured":"Kolotoglu, E., Yaz\u0131c\u0131, E.\u015e: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of t-designs. Graph. Comb. 26(2), 259\u2013281 (2010)","journal-title":"Graph. Comb."},{"issue":"2","key":"2_CR42","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ejc.2008.05.007","volume":"30","author":"JG Lefevre","year":"2009","unstructured":"Lefevre, J.G., Donovan, D.M., Grannell, M.J., Griggs, T.S.: A constraint on the biembedding of Latin squares. Eur. J. Comb. 30(2), 380\u2013386 (2009)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"2_CR43","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/01611194.2015.1028681","volume":"40","author":"D Loebenberger","year":"2016","unstructured":"Loebenberger, D., N\u00fcsken, M.: Design principles of DES-like ciphers: a historical overview. Cryptologia 40(3), 221\u2013239 (2016)","journal-title":"Cryptologia"},{"doi-asserted-by":"crossref","unstructured":"Mariot, L., Manzoni, L.A.: A classification of S-boxes generated by orthogonal cellular automata. Nat. Comput (2023). https:\/\/doi.org\/10.1007\/s11047-023-09956-z","key":"2_CR44","DOI":"10.21203\/rs.3.rs-2671311\/v1"},{"unstructured":"Mariot, L.: Cellular automata, Boolean functions and combinatorial designs. d\u2019Universit\u00e9 C\u00f4te d\u2019Azur (2018)","key":"2_CR45"},{"unstructured":"Mariot, L., Formenti, E., Leporati, A.: Constructing orthogonal Latin squares from linear cellular automata. arXiv preprint arXiv:1610.00139 (2016)","key":"2_CR46"},{"unstructured":"Martin, K.M.: Discrete structures in the theory of secret sharing, PhD Dissertation, University of London (1991)","key":"2_CR47"},{"doi-asserted-by":"crossref","unstructured":"May, L., Henricksen, M., Millan, W., Carter, G., Dawson, E.: Strengthening the key schedule of the AES. In: Information Security and Privacy, pp. 117\u2013134 (2002)","key":"2_CR48","DOI":"10.1007\/3-540-45450-0_19"},{"doi-asserted-by":"crossref","unstructured":"Millan, W., Clark, A., Dawson, E.: Heuristic design of cryptographically strong balanced Boolean functions. In: Advances in Cryptology-EUROCRYPT\u201998: International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, 1998, Proceedings 17, vol. 19. Springer, Berlin, Heidelberg (1998)","key":"2_CR49","DOI":"10.1007\/BFb0054148"},{"issue":"3","key":"2_CR50","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1111\/j.0824-7935.2004.00246.x","volume":"20","author":"W Millan","year":"2004","unstructured":"Millan, W., Fuller, J., Dawson, E.: New concepts in evolutionary search for Boolean functions in cryptology. Comput. Intell. 20(3), 463\u2013474 (2004)","journal-title":"Comput. Intell."},{"issue":"3","key":"2_CR51","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1049\/iet-ifs.2017.0075","volume":"12","author":"S Neves","year":"2018","unstructured":"Neves, S., Tibouchi, M.: Degenerate curve attacks: extending invalid curve attacks to Edwards curves and other models. IET Inf. Secur. 12(3), 217\u2013225 (2018)","journal-title":"IET Inf. Secur."},{"doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Robust, privacy protecting and publicly verifiable sealed-bid auction. In 4th International Conference of Information and Communications Security, ICICS 2002, vol. 2513, pp. 147\u2013159. LNCS, Springer, Berlin (2002)","key":"2_CR52","DOI":"10.1007\/3-540-36159-6_13"},{"doi-asserted-by":"crossref","unstructured":"Peng, K. Boyd. C., Dawson, E.: Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing. Progress in Cryptology-Mycrypt, pp. 84\u201398 (2005)","key":"2_CR53","DOI":"10.1007\/11554868_7"},{"key":"2_CR54","first-page":"147","volume":"57","author":"J Seberry","year":"2000","unstructured":"Seberry, J., Street, A.P.: Strongbox secured secret sharing schemes. Utilitas Math. 57, 147\u2013163 (2000)","journal-title":"Utilitas Math."},{"key":"2_CR55","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.autcon.2016.04.001","volume":"68","author":"N Skandhakumar","year":"2016","unstructured":"Skandhakumar, N., Salim, F., Reid, J., Drogemuller, R., Dawson, E.: Graph theory based representation of building information models for access control applications. Autom. Constr. 68, 44\u201351 (2016)","journal-title":"Autom. Constr."},{"key":"2_CR56","first-page":"80","volume":"853","author":"Y Song","year":"1993","unstructured":"Song, Y., Tsujii, S.: Secret sharing schemes and combinatorial designs. RIMS K\u00f4ky\u00fbroku 853, 80\u201387 (1993)","journal-title":"RIMS K\u00f4ky\u00fbroku"},{"key":"2_CR57","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson, D.R.: An explication of secret sharing schemes. Des. Codes Crypt. 2, 357\u2013390 (1992)","journal-title":"Des. Codes Crypt."},{"key":"2_CR58","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition constructions for secret-sharing schemes. IEEE Trans. Inf. Theory 40, 118\u2013125 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Stinson, D.R.: Combinatorial designs and cryptography, revisited, in 50 Years of combinatorics, graph theory, and computing. In: Chung, F., Graham, R., Hoffman, F., Hogben, F., Mullin, R.C., West, D.B.: Routledge Handbooks Online, Boca Raton. CRC Press (2019)","key":"2_CR59"},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10623-015-0123-1","volume":"80","author":"R Stones","year":"2016","unstructured":"Stones, R., Su, M., Liu, X., Wang, G., Lin, S.: A Latin square autotopism secret sharing scheme. Des. Codes Crypt. 80, 635\u2013650 (2016)","journal-title":"Des. Codes Crypt."},{"unstructured":"Takeuti, I., Tomoko, A.: Secret sharing scheme with perfect concealment. Cryptology ePrint Archive (2023)","key":"2_CR61"}],"container-title":["Lecture Notes in Computer Science","Information Security in a Connected World"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83490-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T06:24:05Z","timestamp":1741760645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83490-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834899","9783031834905"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83490-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}