{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:16:15Z","timestamp":1772910975571,"version":"3.50.1"},"reference-count":23,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"vor","delay-in-days":303,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972124"],"award-info":[{"award-number":["61972124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11974096"],"award-info":[{"award-number":["11974096"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972350"],"award-info":[{"award-number":["61972350"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007820","name":"Hangzhou Normal University","doi-asserted-by":"publisher","award":["2020QDL016"],"award-info":[{"award-number":["2020QDL016"]}],"id":[{"id":"10.13039\/501100007820","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017549","name":"Science and Technology Innovation 2025 Major Project of Ningbo","doi-asserted-by":"publisher","award":["2021Z109"],"award-info":[{"award-number":["2021Z109"]}],"id":[{"id":"10.13039\/501100017549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY23F020013"],"award-info":[{"award-number":["LY23F020013"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:p>With the deepening of research, how to construct a fully homomorphic signcryption scheme based on standard assumptions is a problem that we need to solve. For this question, recently, Jin et al. proposed a leveled fully homomorphic signcryption scheme from standard lattices. However, when verifying, it is supposed to unsigncrypt first as they utilize sign\u2010then\u2010encrypt method. This leads to users being unable to verify the authenticity of the data first, which resulting in the waste of resources. This raises another question of how to construct an fully homomorphic signcryption (FHSC) scheme with public verifiability. To solve this problem, we propose a leveled fully homomorphic signcryption scheme that can be publicly verified and show its completeness, IND\u2010CPA security, and strong unforgeability.<\/jats:p>","DOI":"10.1049\/2023\/1377042","type":"journal-article","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T16:20:09Z","timestamp":1698769209000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme"],"prefix":"10.1049","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9819-4965","authenticated-orcid":false,"given":"Zhaoxuan","family":"Bian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6178-3630","authenticated-orcid":false,"given":"Fuqun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4441-5163","authenticated-orcid":false,"given":"Renjun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Lian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"crossref","unstructured":"GentryC. Fully homomorphic encryption using ideal lattices Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing 2009 169\u2013178.","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_2_8_2_2","doi-asserted-by":"crossref","unstructured":"BrakerskiZ.andVaikuntanathanV. Efficient fully homomorphic encryption from (standard) LWE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science 2011 Palm Springs CA USA IEEE 97\u2013106 https:\/\/doi.org\/10.1109\/FOCS.2011.12 2-s2.0-80955132201.","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_2_8_3_2","doi-asserted-by":"crossref","unstructured":"BrakerskiZ. Fully homomorphic encryption without modulus switching from classical gapsvp Advances in Cryptology\u2013CRYPTO 2012: 32nd Annual Cryptology Conference August 19\u201323 2012 Santa Barbara CA USA Springer 868\u2013886 Proceedings.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_2_8_5_2","doi-asserted-by":"crossref","unstructured":"GentryC. SahaiA. andWatersB. Homomorphic encryption from learning with errors: Conceptually-simpler asymptotically-faster attribute-based Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference August 18\u201322 2013 Santa Barbara CA USA Springer 75\u201392 Proceedings Part I.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_2_8_6_2","doi-asserted-by":"crossref","unstructured":"CheonJ. H. KimA. KimM. andSongY. Homomorphic encryption for arithmetic of approximate numbers Advances in Cryptology\u2013ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security December 3\u20137 2017 Hong Kong China Springer 409\u2013437 Proceedings Part I 23.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_2_8_7_2","doi-asserted-by":"crossref","unstructured":"GorbunovS. VaikuntanathanV. andWichsD. Leveled fully homomorphic signatures from standard lattices Proceedings of the forty-seventh annual ACM symposium on Theory of computing 2015 469\u2013477.","DOI":"10.1145\/2746539.2746576"},{"key":"e_1_2_8_8_2","doi-asserted-by":"crossref","unstructured":"WangF. WangK. LiB. andGaoY. Leveled strongly-unforgeable identity-based fully homomorphic signatures Information Security: 18th International Conference ISC 2015 September 9\u201311 2015 Trondheim Norway Springer 42\u201360 Proceedings 18.","DOI":"10.1007\/978-3-319-23318-5_3"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/9942717"},{"key":"e_1_2_8_10_2","doi-asserted-by":"crossref","unstructured":"ZhengY. Digital signcryption or how to achieve cost (signature & encryption) \u226a cost (signature)+ cost (encryption) Advances in CryptologyCRYPTO\u201997: 17th Annual International Cryptology Conference 1997 Santa Barbara California USA Springer 17\u201321.","DOI":"10.1007\/BFb0052234"},{"key":"e_1_2_8_11_2","doi-asserted-by":"crossref","unstructured":"RezaeibaghaF. MuY. ZhangS. andWangX. Provably secure homomorphic signcryption Provable Security: 11th International Conference ProvSec 2017 October 23\u201325 2017 Xi\u2019an China Springer 349\u2013360.","DOI":"10.1007\/978-3-319-68637-0_21"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1049\/ise2.12026"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3264497"},{"key":"e_1_2_8_14_2","doi-asserted-by":"crossref","unstructured":"TsabaryR. An equivalence between attribute-based signatures and homomorphic signatures and new constructions for both Theory of Cryptography: 15th International Conference TCC 2017 November 12\u201315 2017 Baltimore MD USA Springer 489\u2013518 Proceedings Part II.","DOI":"10.1007\/978-3-319-70503-3_16"},{"key":"e_1_2_8_15_2","doi-asserted-by":"crossref","unstructured":"AjtaiM. Generating hard instances of lattice problems Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing 1996 99\u2013108.","DOI":"10.1145\/237814.237838"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433511"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_2_8_18_2","doi-asserted-by":"crossref","unstructured":"MicciancioD.andPeikertC. Hardness of sis and lwe with small parameters Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference August 18\u201322 2013 Santa Barbara CA USA Springer 21\u201339 Proceedings Part I.","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_2_8_20_2","doi-asserted-by":"crossref","unstructured":"AjtaiM. Generating hard instances of the short basis problem Automata Languages and Programming: 26th International Colloquium ICALP99 Prague July 11\u201315 1999 Czech Republic Springer 1\u20139 Proceedings 26.","DOI":"10.1007\/3-540-48523-6_1"},{"key":"e_1_2_8_21_2","doi-asserted-by":"crossref","unstructured":"GentryC. PeikertC. andVaikuntanathanV. Trapdoors for hard lattices and new cryptographic constructions Proceedings of the fortieth annual ACM symposium on Theory of computing 2008 197\u2013206.","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9278-3"},{"key":"e_1_2_8_23_2","doi-asserted-by":"crossref","unstructured":"MicciancioD.andPeikertC. Trapdoors for lattices: simpler tighter faster smaller Annual International Conference on the Theory and Applications of Cryptographic Techniques 2012 Berlin Heidelberg Springer Berlin Heidelberg 700\u2013718.","DOI":"10.1007\/978-3-642-29011-4_41"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2023\/1377042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2023\/1377042.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/2023\/1377042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T16:49:35Z","timestamp":1762361375000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/2023\/1377042"}},"subtitle":[],"editor":[{"given":"Guowen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["10.1049\/2023\/1377042"],"URL":"https:\/\/doi.org\/10.1049\/2023\/1377042","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"2023-08-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1377042"}}