{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:27:06Z","timestamp":1726064826860},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030384708"},{"type":"electronic","value":"9783030384715"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38471-5_1","type":"book-chapter","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T22:04:42Z","timestamp":1578607482000},"page":"3-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Looking Back\u2014My Life as a Mathematician and Cryptographer"],"prefix":"10.1007","author":[{"given":"Douglas R.","family":"Stinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/01611194.2011.583711","volume":"35","author":"SM Bellovin","year":"2011","unstructured":"Bellovin, S.M.: Frank Miller: inventor of the one-time pad. Cryptologia 35, 203\u2013222 (2011)","journal-title":"Cryptologia"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"CH Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17, 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/0605029","volume":"5","author":"IF Blake","year":"1984","unstructured":"Blake, I.F., Fuji-Hara, R., Mullin, R.C., Vanstone, S.A.: Computing logarithms in finite fields of characteristic two. SIAM J. Algebraic Discrete Methods 5, 276\u2013285 (1984)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing for general access structures. Cryptology ePrint Archive: Report 2019\/602","DOI":"10.1007\/978-3-030-36033-7_8"},{"key":"1_CR5","first-page":"141","volume":"43","author":"EF Brickell","year":"1984","unstructured":"Brickell, E.F.: A few results in message authentication. Congressus Numerantium 43, 141\u2013154 (1984)","journal-title":"Congressus Numerantium"},{"key":"1_CR6","unstructured":"Delsarte, P.: The association schemes of coding theory. Ph.D. thesis, Universit\u00e9 Catholique de Louvain, June 1973"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1137\/0602007","volume":"2","author":"JH Dinitz","year":"1981","unstructured":"Dinitz, J.H., Stinson, D.R.: A fast algorithm for finding strong starters. SIAM J. Algebraic Discrete Methods 2, 50\u201356 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"1_CR9","volume-title":"Ingenuity in Mathematics","author":"R Honsberger","year":"1975","unstructured":"Honsberger, R.: Ingenuity in Mathematics. Mathematical Association of America, Washington, DC (1975)"},{"key":"1_CR10","doi-asserted-by":"crossref","DOI":"10.1090\/dol\/003","volume-title":"Mathematical Morsels","author":"R Honsberger","year":"1979","unstructured":"Honsberger, R.: Mathematical Morsels. Mathematical Association of America, New York (1979)"},{"key":"1_CR11","first-page":"277","volume":"6","author":"RC Mullin","year":"1978","unstructured":"Mullin, R.C., Stinson, D.R., Wallis, W.D.: Concerning the spectrum of skew room squares. Ars Combinatoria 6, 277\u2013291 (1978)","journal-title":"Ars Combinatoria"},{"key":"1_CR12","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440147","volume-title":"Combinatorial Mathematics","author":"H Ryser","year":"1963","unstructured":"Ryser, H.: Combinatorial Mathematics. Mathematical Association of America, New York (1963)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"volume-title":"Contemporary Cryptology: The Science of Information Integrity","year":"1992","key":"1_CR14","unstructured":"Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, Piscataway (1992)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-47721-7_30","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"DR Stinson","year":"1987","unstructured":"Stinson, D.R.: Some constructions and bounds for authentication codes. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 418\u2013425. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_30"},{"key":"1_CR16","first-page":"105","volume":"92","author":"DR Stinson","year":"1993","unstructured":"Stinson, D.R.: Resilient functions and large sets of orthogonal arrays. Congressus Numerantium 92, 105\u2013110 (1993)","journal-title":"Congressus Numerantium"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00202271","volume":"8","author":"DR Stinson","year":"1995","unstructured":"Stinson, D.R., Massey, J.L.: An infinite class of counterexamples to a conjecture concerning non-linear resilient functions. J. Cryptol. 8, 167\u2013173 (1995)","journal-title":"J. Cryptol."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-48184-2_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 1987","author":"DR Stinson","year":"1988","unstructured":"Stinson, D.R., Vanstone, S.A.: A combinatorial approach to threshold schemes. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 330\u2013339. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_28"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH Lint van","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"1_CR20","series-title":"NATO Advanced Study Institutes Series book series","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-94-010-1826-5_2","volume-title":"Combinatorics","author":"RM Wilson","year":"1975","unstructured":"Wilson, R.M.: Constructions and uses of pairwise balanced designs. In: Hall, M., van Lint, J.H. (eds.) Combinatorics. ASIC, vol. 16, pp. 19\u201342. (1975). https:\/\/doi.org\/10.1007\/978-94-010-1826-5_2"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38471-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,16]],"date-time":"2021-02-16T05:56:31Z","timestamp":1613454991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38471-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030384708","9783030384715"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38471-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Waterloo, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uwaterloo.ca\/combinatorics-and-optimization\/news\/sac-2019-august-12-16-2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}