{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T22:22:43Z","timestamp":1774477363692,"version":"3.50.1"},"reference-count":32,"publisher":"Informa UK Limited","issue":"9","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2025,9,2]]},"DOI":"10.1080\/00207160.2025.2493959","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T11:48:37Z","timestamp":1745495317000},"page":"1350-1364","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A verifiable multi-secret sharing scheme based on LCD quadratic residue codes"],"prefix":"10.1080","volume":"102","author":[{"given":"Meriam","family":"Mkadmi","sequence":"first","affiliation":[{"name":"American University of Sharjah","place":["Sharjah, UAE"]}]},{"given":"Taher","family":"Abualrub","sequence":"additional","affiliation":[{"name":"American University of Sharjah","place":["Sharjah, UAE"]}]},{"given":"Irfan","family":"Siap","sequence":"additional","affiliation":[{"name":"Prince Mohammad Bin Fahd University","place":["Al Khobar, Saudi Arabia"]}]}],"member":"301","published-online":{"date-parts":[[2025,4,24]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.3390\/math8020272"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10773-023-05533-3"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0721041"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_3_3_10_1","unstructured":"W. Bosma J.J. Cannon C. Fieker and A. Steels Handbook of Magma functions Edition 2.22 Sydney 2016."},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2021.3082525"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2015.1091071"},{"key":"e_1_3_3_13_1","unstructured":"A. Chandramouli A. Choudhury and A. Patra A survey on perfectly-secure verifiable secret-sharing Cryptology ePrint Archive Paper 2021\/445 2021."},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335343"},{"key":"e_1_3_3_17_1","doi-asserted-by":"crossref","unstructured":"Y. Desmedt K. Kurosawa and T. Van Le Error correcting and complexity aspects of linear secret sharing schemes in Information Security ISC 2003 Lecture Notes in Computer Science C. Boyd and W. Mao eds. Vol. 2851 Springer Berlin Heidelberg 2003.","DOI":"10.1007\/10958513_30"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_3_3_19_1","unstructured":"J. Garay C. Givens R. Ostrovsky and P. Raykov Broadcast (and round) efficient verifiable secret sharing Cryptology ePrint Archive Paper 2012\/130 2012."},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MESIICON55227.2022.10093356"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2012.0381"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-008-0074-0"},{"key":"e_1_3_3_23_1","volume-title":"A First Course in Coding Theory","author":"Hill R.","year":"1986","unstructured":"R. Hill, A First Course in Coding Theory, Clarendon Press, Oxford, 1986."},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"issue":"4","key":"e_1_3_3_25_1","first-page":"688","article-title":"An online verifiable and detectable \n(t,n) multi-secret sharing scheme based on a hyperelliptic function","volume":"8","author":"Juan J.S.-T.","year":"2011","unstructured":"J.S.-T. Juan, Y.-L. Chuang, and M.-J. Li, An online verifiable and detectable (t,n) multi-secret sharing scheme based on a hyperelliptic function, J. Inform. Comput. Sci. 8(4) (2011), pp. 688\u2013696.","journal-title":"J. Inform. Comput. Sci."},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2015.1075986"},{"issue":"5","key":"e_1_3_3_27_1","first-page":"529","article-title":"A \n(t,n) threshold secret sharing system with efficient identification of cheaters","volume":"24","author":"Lin I.-C.","year":"2005","unstructured":"I.-C. Lin and C.-C. Chang, A (t,n) threshold secret sharing system with efficient identification of cheaters, Comput. Inform. 24(5) (2005), pp. 529\u2013541.","journal-title":"Comput. Inform."},{"key":"e_1_3_3_28_1","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams F.J.","year":"1977","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland Publishing Co., Amsterdam, 1977."},{"key":"e_1_3_3_29_1","unstructured":"S. Roman Graduate Texts in Mathematics Coding and Information Theory Springer-Verlag 1992."},{"key":"e_1_3_3_30_1","first-page":"612","article-title":"How to share a secret","volume":"22","author":"Shamir A.","year":"1979","unstructured":"A. Shamir, How to share a secret, Commun. Assoc. Comp. Mach. 22 (1979), pp. 612\u2013613.","journal-title":"Commun. Assoc. Comp. Mach."},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.11.027"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-015-0299-2"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0575-0"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2025.2493959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T07:29:58Z","timestamp":1756711798000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2025.2493959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,24]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9,2]]}},"alternative-id":["10.1080\/00207160.2025.2493959"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2025.2493959","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,24]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-07-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-10","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}