{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T05:03:39Z","timestamp":1784955819193,"version":"3.55.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"MeitY Project","award":["MIT- 2473-CSE-TSA\/24-25"],"award-info":[{"award-number":["MIT- 2473-CSE-TSA\/24-25"]}]},{"DOI":"10.13039\/501100001843","name":"Anusandhan National Research Foundation","doi-asserted-by":"crossref","award":["ANRF\/ECRG\/2025\/002808\/PMS"],"award-info":[{"award-number":["ANRF\/ECRG\/2025\/002808\/PMS"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08732-x","type":"journal-article","created":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T04:58:33Z","timestamp":1784955513000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LaSDVS: a post-quantum secure compact strong-designated verifier signature with applications to genomic consent authorization"],"prefix":"10.1007","volume":"82","author":[{"given":"Shanu","family":"Poddar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sweta","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tapaswini","family":"Mohanty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vikas","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sugata","family":"Gangopadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,25]]},"reference":[{"key":"8732_CR1","doi-asserted-by":"publisher","unstructured":"Akleylek S, Alkim E, Tok ZY (2016) Sparse polynomial multiplication for lattice-based cryptography with small complexity. J Supercomput 72:438\u2013450. https:\/\/doi.org\/10.1007\/s11227-015-1570-1","DOI":"10.1007\/s11227-015-1570-1"},{"key":"8732_CR2","doi-asserted-by":"publisher","unstructured":"Goey J-Z, Lee W-K, Goi B-M, Yap W-S (2021) Accelerating number theoretic transform in GPU platform for fully homomorphic encryption. J Supercomput 77:1455\u20131474. https:\/\/doi.org\/10.1007\/s11227-020-03156-7","DOI":"10.1007\/s11227-020-03156-7"},{"key":"8732_CR3","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1007\/s11227-020-03392-x","volume":"77","author":"W-K Lee","year":"2021","unstructured":"Lee W-K, Akleylek S, Wong DC-K, Yap W-S, Goi B-M, Hwang S-O (2021) Parallel implementation of Nussbaumer algorithm and number theoretic transform on a GPU platform: application to qTESLA. J Supercomput 77:3289\u20133314. https:\/\/doi.org\/10.1007\/s11227-020-03392-x","journal-title":"J Supercomput"},{"key":"8732_CR4","doi-asserted-by":"publisher","unstructured":"\u00d6zerk O, Elgezen C, Mert AC, \u00d6zt\u00fcrk E, Savas E (2022) Efficient number theoretic transform implementation on GPU for homomorphic encryption. J Supercomput 78:2840\u20132872. https:\/\/doi.org\/10.1007\/s11227-021-03980-5","DOI":"10.1007\/s11227-021-03980-5"},{"issue":"7","key":"8732_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/129902.129904","volume":"35","author":"C Nist","year":"1992","unstructured":"Nist C (1992) The digital signature standard. Commun ACM 35(7):36\u201340","journal-title":"Commun ACM"},{"key":"8732_CR6","doi-asserted-by":"crossref","unstructured":"Katz J (2010) Digital signatures, vol 1. Springer","DOI":"10.1007\/978-0-387-27712-7"},{"key":"8732_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201996","author":"M Jakobsson","year":"1996","unstructured":"Jakobsson M, Sako K, Impagliazzo R (1996) Designated verifier proofs and their applications. In: Maurer U (ed) Advances in Cryptology \u2013 EUROCRYPT \u201996. Springer, Berlin, Heidelberg, pp 143\u2013154"},{"key":"8732_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-30598-9_8","volume-title":"Security in communication networks","author":"F Laguillaumie","year":"2005","unstructured":"Laguillaumie F, Vergnaud D (2005) Designated verifier signatures: anonymity and efficient construction from any bilinear map. In: Blundo C, Cimato S (eds) Security in communication networks. Springer, Berlin, Heidelberg, pp 105\u2013119"},{"issue":"5","key":"8732_CR9","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5):1484\u20131509. https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J Comput"},{"key":"8732_CR10","unstructured":"National Institute of Standards and Technology: NIST Announces Report on Post-Quantum Cryptography (PQC). https:\/\/csrc.nist.gov\/pubs\/ir\/8105\/final. Accessed: April 2016 (2016)"},{"key":"8732_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1711-2","volume-title":"An introduction to mathematical cryptography","author":"J Hoffstein","year":"2014","unstructured":"Hoffstein J, Pipher J, Silverman JH (2014) An introduction to mathematical cryptography, 2nd edn. Springer, New York","edition":"2"},{"key":"8732_CR12","doi-asserted-by":"crossref","unstructured":"Ding J, Gower JE, Schmidt DS (2006) Multivariate public key cryptosystems, vol 25. Springer","DOI":"10.1090\/conm\/419\/07997"},{"key":"8732_CR13","unstructured":"Srivastava V, Baksi A, Debnath SK (2023) An overview of hash based signatures. Cryptology ePrint Archive, Paper 2023\/411. https:\/\/eprint.iacr.org\/2023\/411"},{"key":"8732_CR14","doi-asserted-by":"crossref","unstructured":"Overbeck R, Sendrier N (2009) Code-based cryptography. Post-quantum Cryptography. Springer, pp 95\u2013145","DOI":"10.1007\/978-3-540-88702-7_4"},{"issue":"3","key":"8732_CR15","doi-asserted-by":"publisher","first-page":"2993","DOI":"10.1007\/s11276-025-03906-6","volume":"31","author":"S Mishra","year":"2025","unstructured":"Mishra S, Mondal B, Jha RK (2025) A survey on isogeny-based cryptographic protocols. Wireless Netw 31(3):2993\u20133024","journal-title":"Wireless Netw"},{"key":"8732_CR16","doi-asserted-by":"publisher","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. STOC \u201905. Association for Computing Machinery, New York, NY, USA, pp 84\u201393. https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"8732_CR17","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2007) Trapdoors for Hard Lattices and New Cryptographic Constructions. Cryptology ePrint Archive, Paper 2007\/432. https:\/\/eprint.iacr.org\/2007\/432"},{"issue":"1","key":"8732_CR18","first-page":"11","volume":"25","author":"F Wang","year":"2012","unstructured":"Wang F, Hu Y, Wang B (2012) Lattice-based strong designate verifier signature and its applications. Malays J Comput Sci 25(1):11\u201322","journal-title":"Malays J Comput Sci"},{"issue":"18","key":"8732_CR19","doi-asserted-by":"publisher","first-page":"6202","DOI":"10.1002\/sec.1766","volume":"9","author":"G Noh","year":"2016","unstructured":"Noh G, Jeong IR (2016) Strong designated verifier signature scheme from lattices in the standard model. Secur Commun Netw 9(18):6202\u20136214. https:\/\/doi.org\/10.1002\/sec.1766","journal-title":"Secur Commun Netw"},{"key":"8732_CR20","doi-asserted-by":"publisher","unstructured":"Cai J, Jiang H, Zhang P, Zheng Z, Lyu G, Xu Q (2019) An efficient strong designated verifier signature based on $$\\cal{R}-$$ sis assumption. IEEE Access 7:3938\u20133947. https:\/\/doi.org\/10.1109\/ACCESS.2018.2889242","DOI":"10.1109\/ACCESS.2018.2889242"},{"key":"8732_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/11523468_38","volume-title":"Automata, languages and programming","author":"H Lipmaa","year":"2005","unstructured":"Lipmaa H, Wang G, Bao F (2005) Designated verifier signature schemes: attacks, new security notions and a new construction. In: Caires L, Italiano GF, Monteiro L, Palamidessi C, Yung M (eds) Automata, languages and programming. Springer, Berlin, Heidelberg, pp 459\u2013471"},{"key":"8732_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2024.103904","volume":"92","author":"Y Zhang","year":"2025","unstructured":"Zhang Y, Susilo W, Guo F (2025) Lattice-based strong designated verifier signature with non-delegatability. Comput Stand Interfaces 92:103904. https:\/\/doi.org\/10.1016\/j.csi.2024.103904","journal-title":"Comput Stand Interfaces"},{"key":"8732_CR23","doi-asserted-by":"publisher","unstructured":"Laguillaumie F, Vergnaud D ()2004 Multi-designated verifiers signatures. In: Information and Communications Security. Lecture Notes in Computer Science, vol 3269. Springer, pp 495\u2013507. https:\/\/doi.org\/10.1007\/978-3-540-30191-2_38","DOI":"10.1007\/978-3-540-30191-2_38"},{"issue":"2\u20133","key":"8732_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ipl.2006.08.015","volume":"102","author":"F Laguillaumie","year":"2007","unstructured":"Laguillaumie F, Vergnaud D (2007) Multi-designated verifiers signatures: anonymity without encryption. Inf Process Lett 102(2\u20133):127\u2013132. https:\/\/doi.org\/10.1016\/j.ipl.2006.08.015","journal-title":"Inf Process Lett"},{"key":"8732_CR25","doi-asserted-by":"publisher","unstructured":"Zhang Y, Au MH, Yang G, Susilo W (2012) (strong) multi-designated verifiers signatures secure against rogue key attack. In: Network and System Security. Lecture Notes in Computer Science, vol 7645. Springer, pp 334\u2013347. https:\/\/doi.org\/10.1007\/978-3-642-34601-9_25","DOI":"10.1007\/978-3-642-34601-9_25"},{"key":"8732_CR26","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd I, Haagh H, Mercer R, Nitulescu A, Orlandi C, Yakoubov S (2020) Stronger security and constructions of multi-designated verifier signatures. In: Theory of Cryptography. Lecture Notes in Computer Science, vol 12551. Springer, pp 229\u2013260. https:\/\/doi.org\/10.1007\/978-3-030-64378-2_9","DOI":"10.1007\/978-3-030-64378-2_9"},{"issue":"1","key":"8732_CR27","doi-asserted-by":"publisher","first-page":"20230028","DOI":"10.1515\/jmc-2023-0028","volume":"18","author":"K Yamashita","year":"2024","unstructured":"Yamashita K, Hara K (2024) On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes. J Math Cryptol 18(1):20230028. https:\/\/doi.org\/10.1515\/jmc-2023-0028","journal-title":"J Math Cryptol"},{"key":"8732_CR28","doi-asserted-by":"publisher","unstructured":"Hashimoto K, Yamashita K, Hara K (2025) Foundations of multi-designated verifier signature: comprehensive formalization and new constructions in subset simulation. In: 2025 IEEE 38th Computer Security Foundations Symposium (CSF). IEEE, pp 159\u2013174. https:\/\/doi.org\/10.1109\/CSF64896.2025.00012","DOI":"10.1109\/CSF64896.2025.00012"},{"key":"8732_CR29","unstructured":"Micciancio D, Peikert C (2011) Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. Cryptology ePrint Archive, Paper 2011\/501. https:\/\/eprint.iacr.org\/2011\/501"},{"key":"8732_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-16745-9_14","volume-title":"Information security and cryptology","author":"RWF Lai","year":"2015","unstructured":"Lai RWF, Cheung HKF, Chow SSM (2015) Trapdoors for ideal lattices with applications. In: Lin D, Yung M, Zhou J (eds) Information security and cryptology. Springer, Cham, pp 239\u2013256"},{"key":"8732_CR31","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-79063-3_13","volume-title":"Post-quantum cryptography","author":"P Bert","year":"2018","unstructured":"Bert P, Fouque P-A, Roux-Langlois A, Sabt M (2018) Practical implementation of ring-SIS\/LWE based signature and IBE. In: Lange T, Steinwandt R (eds) Post-quantum cryptography. Springer, Cham, pp 271\u2013291"},{"key":"8732_CR32","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in cryptology - EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Pointcheval D, Johansson T (eds) Advances in cryptology - EUROCRYPT 2012. Springer, Berlin, Heidelberg, pp 738\u2013755"},{"key":"8732_CR33","doi-asserted-by":"publisher","unstructured":"Bellare M, Neven G (2006) Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. CCS \u20190. Association for Computing Machinery, New York, NY, USA, pp 390\u2013399. https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"8732_CR34","doi-asserted-by":"publisher","unstructured":"Barelli R, D\u2019Onghia M, Longari S (2025) Toward secure electronic voting: a survey on e-voting systems and attacks. IEEE Access 1\u20131. https:\/\/doi.org\/10.1109\/ACCESS.2025.3569334","DOI":"10.1109\/ACCESS.2025.3569334"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08732-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08732-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08732-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T04:58:35Z","timestamp":1784955515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08732-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,25]]},"references-count":34,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2026,7]]}},"alternative-id":["8732"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08732-x","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,25]]},"assertion":[{"value":"22 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"587"}}