{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:07:41Z","timestamp":1743052061793,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031330162"},{"type":"electronic","value":"9783031330179"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33017-9_8","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T12:02:32Z","timestamp":1684411352000},"page":"129-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Keyed Hash Function Based on\u00a0Latin Squares and Error-Correcting Codes to\u00a0Authenticate Users in\u00a0Smart Home Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6959-8352","authenticated-orcid":false,"given":"Hussain","family":"Ahmad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0098-7293","authenticated-orcid":false,"given":"Carolin","family":"Hannusch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-030-45371-8_17","volume-title":"Foundations and Practice of Security","author":"EB Ayebie","year":"2020","unstructured":"Ayebie, E.B., Assidi, H., Souidi, E.M.: An efficient identification scheme based on rank metric. In: Benzekri, A., Barbeau, M., Gong, G., Laborde, R., Garcia-Alfaro, J. (eds.) FPS 2019. LNCS, vol. 12056, pp. 273\u2013289. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45371-8_17"},{"key":"8_CR2","unstructured":"Chum, C.S., Zhang, X.: Applying hash functions in the Latin square based secret sharing schemes. In: Security and Management, pp. 197\u2013203 (2010)"},{"issue":"6","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"JH Conway","year":"1990","unstructured":"Conway, J.H., Sloane, N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36(6), 1319\u20131333 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-662-46803-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I.B., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 313\u2013336. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_11"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1016\/j.procs.2015.02.144","volume":"46","author":"R Ghosh","year":"2015","unstructured":"Ghosh, R., Verma, S., Kumar, R., Kumar, S., Ram, S.: Design of hash algorithm using Latin square. Procedia Comput. Sci. 46, 759\u2013765 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"8_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-030-12082-5_51","volume-title":"Advances in Artificial Systems for Medicine and Education II","author":"S Gnatyuk","year":"2020","unstructured":"Gnatyuk, S., Kinzeryavyy, V., Kyrychenko, K., Yubuzova, K., Aleksander, M., Odarchenko, R.: Secure hash function constructing for future communication systems and networks. In: Hu, Z., Petoukhov, S.V., He, M. (eds.) AIMEE2018 2018. AISC, vol. 902, pp. 561\u2013569. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-12082-5_51"},{"key":"8_CR7","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 519\u2013535 (2021)"},{"issue":"1\u20132","key":"8_CR8","first-page":"55","volume":"26","author":"C Hannusch","year":"2021","unstructured":"Hannusch, C., Horv\u00e1th, G.: Properties of hash functions based on Glu\u0161kov product of automata. J. Autom. Lang. Comb. 26(1\u20132), 55\u201365 (2021)","journal-title":"J. Autom. Lang. Comb."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Hannusch, C., Major, S. R.: Torch: software package for the search of linear binary codes. In: 2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS), pp. 103\u2013106, IEEE (2022)","DOI":"10.1109\/CITDS54976.2022.9914052"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"80980","DOI":"10.1109\/ACCESS.2019.2923728","volume":"7","author":"SS Hussain","year":"2019","unstructured":"Hussain, S.S., Farooq, S.M., Ustun, T.S.: Analysis and implementation of message authentication code (MAC) algorithms for GOOSE message security. IEEE Access 7, 80980\u201380984 (2019)","journal-title":"IEEE Access"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Huszti, A., Kov\u00e1cs, S., Ol\u00e1h, N.: Scalable, password-based and threshold authentication for smart homes. Int. J. Inf. Sec., 1\u201317 (2022)","DOI":"10.1007\/s10207-022-00578-7"},{"key":"8_CR12","volume-title":"Latin Squares and Their Applications","author":"AD Keedwell","year":"2015","unstructured":"Keedwell, A.D., D\u00e9nes, J.: Latin Squares and Their Applications. Elsevier, Amsterdam (2015)"},{"key":"8_CR13","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3. Sorting and Searching (1973)"},{"key":"8_CR14","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)"},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/9780429466335","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"2018","unstructured":"Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (2018)"},{"key":"8_CR16","unstructured":"OEIS Foundation Inc. (2022). The On-Line Encyclopedia of Integer Sequences, Published electronically at http:\/\/oeis.org"},{"issue":"3","key":"8_CR17","first-page":"233","volume":"13","author":"SK Pal","year":"2010","unstructured":"Pal, S.K., Kapoor, S., Arora, A., Chaudhary, R., Khurana, J.: Design of strong cryptographic schemes based on Latin squares. J. Discr. Math. Sci. Crypt. 13(3), 233\u2013256 (2010)","journal-title":"J. Discr. Math. Sci. Crypt."},{"key":"8_CR18","volume-title":"Handbook of Coding Theory","author":"V Pless","year":"1998","unstructured":"Pless, V., Brualdi, R.A., Huffman, W.C.: Handbook of Coding Theory. Elsevier Science Inc., Amsterdam (1998)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0030408","volume-title":"Information Security","author":"B Preneel","year":"1998","unstructured":"Preneel, B.: Cryptanalysis of message authentication codes. In: Okamoto, E., Davida, G., Mambo, M. (eds.) ISW 1997. LNCS, vol. 1396, pp. 55\u201365. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0030408"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/18.746787","volume":"45","author":"B Preneel","year":"1999","unstructured":"Preneel, B., Van Oorschot, P.C.: On the security of iterated message authentication codes. IEEE Trans. Inf. Theory 45(1), 188\u2013199 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"8_CR21","first-page":"31","volume":"1","author":"F Ramadhani","year":"2020","unstructured":"Ramadhani, F., Ramadhani, U., Basit, L.: Combination of hybrid cryptography in one time pad (OTP) algorithm and keyed-hash message authentication code (HMAC) in securing the Whatsapp communication application. J. Comput. Sci. Inf. Technol. Telecommun. Eng. 1(1), 31\u201336 (2020)","journal-title":"J. Comput. Sci. Inf. Technol. Telecommun. Eng."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Rouillard, J.: Contextual QR codes. In: 2008 The Third International Multi-Conference on Computing in the Global Information Technology (ICCGI 2008), pp. 50\u201355. IEEE (2008)","DOI":"10.1109\/ICCGI.2008.25"},{"issue":"2","key":"8_CR23","first-page":"461","volume":"9","author":"R Sobti","year":"2012","unstructured":"Sobti, R., Geetha, G.: Cryptographic hash functions: a review. Int. J. Comput. Sci. Issues (IJCSI) 9(2), 461 (2012)","journal-title":"Int. J. Comput. Sci. Issues (IJCSI)"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s11071-020-05504-x","volume":"100","author":"JS Teh","year":"2020","unstructured":"Teh, J.S., Alawida, M., Ho, J.J.: Unkeyed hash function based on chaotic sponge construction and fixed-point arithmetic. Nonlinear Dyn. 100(1), 713\u2013729 (2020)","journal-title":"Nonlinear Dyn."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"111443","DOI":"10.1016\/j.chaos.2021.111443","volume":"152","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Chen, L., Wang, X., Wu, G., Yu, K., Lu, T.: The design of keyed hash function based on CNN-MD structure. Chaos, Solitons Fractals 152, 111443 (2021)","journal-title":"Chaos, Solitons Fractals"}],"container-title":["Lecture Notes in Computer Science","Codes, Cryptology and Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33017-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:05:54Z","timestamp":1709654754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33017-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031330162","9783031330179"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33017-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"C2SI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Codes, Cryptology, and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"c2si2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.c2si-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 (invited papers from invited speakers)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}