{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:20:22Z","timestamp":1773879622756,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s12243-021-00843-1","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:02:40Z","timestamp":1641772960000},"page":"119-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Lattice-based undeniable signature scheme"],"prefix":"10.1007","volume":"77","author":[{"given":"Swati","family":"Rawal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6863-6123","authenticated-orcid":false,"given":"Sahadeo","family":"Padhye","sequence":"additional","affiliation":[]},{"given":"Debiao","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"843_CR1","doi-asserted-by":"crossref","unstructured":"Chaum D, van Antwerpen H (1990) Undeniable signatures. In: Proceeding of CRYPTO 1989. LNCS, vol 435. Springer, Heidelberg, pp 212\u2013216","DOI":"10.1007\/0-387-34805-0_20"},{"key":"843_CR2","doi-asserted-by":"crossref","unstructured":"Boyar J, Chaum D, Damgard I, Pedersen T (1991) Convertible undeniable signatures. In: Prodeecing of CRYPTO 1990. LNCS, vol 537. Springer, Heidelberg, pp 189\u2013205","DOI":"10.1007\/3-540-38424-3_14"},{"key":"843_CR3","doi-asserted-by":"crossref","unstructured":"Chaum D, van Heijst E, Pfitzmann B (1992) Cryptographically strong undeniable signatures, unconditionally secure for the signer. In: Prodeecing of CRYPTO 1991. LNCS, vol 576. Springer, Heidelberg, pp 470\u2013484","DOI":"10.1007\/3-540-46766-1_38"},{"key":"843_CR4","doi-asserted-by":"crossref","unstructured":"Damgard I, Pedersen T (1996) New convertible undeniable signature schemes. In: Prodeecing of EUROCRYPT 1996. LNCS, vol 1070. Springer, Heidelberg, pp 372\u2013386","DOI":"10.1007\/3-540-68339-9_32"},{"key":"843_CR5","doi-asserted-by":"crossref","unstructured":"Galbraith S, Mao W (2003) Invisibility and anonymity of undeniable and confirmer signatures. In: Prodeecing of CT-RSA 2003. LNCS, vol 2612. Springer, Heidelberg, pp 80\u201397","DOI":"10.1007\/3-540-36563-X_6"},{"key":"843_CR6","doi-asserted-by":"crossref","unstructured":"Galbraith S, Mao W, Paterson KG (2002) RSA-based undeniable signatures for general moduli. In: Prodeecing of CT-RSA 2002. LNCS, vol 2271. Springer, Heidelberg, pp 200\u2013217","DOI":"10.1007\/3-540-45760-7_14"},{"issue":"4","key":"843_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s001450010001","volume":"13","author":"R Gennaro","year":"2000","unstructured":"Gennaro R, Rabin T, Krawczyk H (2000) RSA-based undeniable signatures. J. Cryptol. 13(4):397\u2013416","journal-title":"J. Cryptol."},{"key":"843_CR8","doi-asserted-by":"crossref","unstructured":"Kurosawa K, Takagi T (2006) New Approach for selectively convertible undeniable signature schemes. In: Lai X, Chen K (eds) ASIACRYPT 2006. LNCS, vol 4284. Springer, Heidelberg, pp 428\u2013443","DOI":"10.1007\/11935230_28"},{"issue":"5","key":"843_CR9","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1109\/TIT.2006.872853","volume":"52","author":"W Ogata","year":"2006","unstructured":"Ogata W, Kurosawa K, Heng S (2006) The security of the FDH variant of Chaum\u2019s undeniable signature scheme. IEEE Trans Inf Theory 52(5):2006\u20132017","journal-title":"IEEE Trans Inf Theory"},{"key":"843_CR10","doi-asserted-by":"crossref","unstructured":"Laguillaumie F, Vergnaud D (2005) Short undeniable signatures without oracles: random the missing link. In: Proceeding of - INDOCRYPT 2005. Springer, Berlin, pp 283\u2013296","DOI":"10.1007\/11596219_23"},{"issue":"1","key":"843_CR11","first-page":"85","volume":"23","author":"CM Tang","year":"2006","unstructured":"Tang CM, Zhao YM (2006) Identity-based undeniable signatures from bilinear pairings. Shenzhen Daxue Xuebao 23(1):85\u201389","journal-title":"Shenzhen Daxue Xuebao"},{"key":"843_CR12","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-12827-1_21","volume":"6047","author":"JCN Schuldt","year":"2009","unstructured":"Schuldt JCN, Matsuura K (2009) An efficient convertible undeniable signature scheme with delegatable verification. Lect Notes Comput Sci 6047:276\u2013293","journal-title":"Lect Notes Comput Sci"},{"issue":"16","key":"843_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2012.02.046","volume":"199","author":"W Zhao","year":"2012","unstructured":"Zhao W, Ye D (2012) Certificateless undeniable signatures from bilinear maps. Inform Sci 199(16):204\u2013215","journal-title":"Inform Sci"},{"issue":"1","key":"843_CR14","first-page":"63","volume":"5","author":"SJ Aboud","year":"2014","unstructured":"Aboud SJ (2014) Secure undeniable threshold proxy signature scheme. Int J Adv Comput Sci & Appl 5(1):63\u201368","journal-title":"Int J Adv Comput Sci & Appl"},{"issue":"5","key":"843_CR15","doi-asserted-by":"publisher","first-page":"2006","DOI":"10.1109\/TIT.2006.872853","volume":"52","author":"W Ogata","year":"2017","unstructured":"Ogata W, Kurosawa K, Heng SH (2017) The security of the FDH variant of Chaum\u2019s undeniable signature scheme. IEEE Trans Inf Theory 52(5):2006\u20132017","journal-title":"IEEE Trans Inf Theory"},{"key":"843_CR16","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of ACM symposium on theory of computing, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"843_CR17","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Proceedings of EUROCRYPT, pp 238\u2013275","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"843_CR18","doi-asserted-by":"crossref","unstructured":"Gordon SD, Katz J, Vaikuntanathan V (2010) A group signature scheme from lattice assumptions. In: Proceedings of ASIACRYPT 2010, pp 395\u2013412","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"843_CR19","doi-asserted-by":"crossref","unstructured":"Ling S, Nguyen K, Wang H, Xu Y (2018) Constant-size group signatures from lattices. In: Abdalla M, Dahab R (eds) Public-Key Cryptography \u2013 PKC 2018. LNCS (10770), pp 58\u201388","DOI":"10.1007\/978-3-319-76581-5_3"},{"key":"843_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2019.03.023","volume":"783","author":"S Ling","year":"2019","unstructured":"Ling S, Nguyen K, Wang H, Xu Y (2019) Lattice-based group signatures: achieving full dynamicity (and deniability) with ease. Theor Comput Sci 783:71\u201394","journal-title":"Theor Comput Sci"},{"key":"843_CR21","doi-asserted-by":"crossref","unstructured":"Wang J, Sun B (2011) Ring signature scheme from lattice basis delegation. In: Proceedings of ICICS, pp 15\u201328","DOI":"10.1007\/978-3-642-25243-3_2"},{"key":"843_CR22","doi-asserted-by":"crossref","unstructured":"Torres AWA et al (2018) Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice RingCT v1.0). In: Proceedings of ACISP. LNCS(10946), pp 558\u2013576. Springer","DOI":"10.1007\/978-3-319-93638-3_32"},{"key":"843_CR23","doi-asserted-by":"crossref","unstructured":"Rawal S, Padhye S (2019) Threshold ring signature with message block sharing. security and privacy. In: Proceedings of ISEA-ISAP 2019 CCIS(939) 1-9 Springer","DOI":"10.1007\/978-981-13-7561-3_19"},{"key":"843_CR24","doi-asserted-by":"crossref","unstructured":"Lu X, Au MH, Zhang Z (2019) Raptor: A Practical Lattice-Based (Linkable) Ring Signature. In: Proceedings of applied cryptography and network security. ACNS 2019. LNCS (11464). Springer","DOI":"10.1007\/978-3-030-21568-2_6"},{"key":"843_CR25","doi-asserted-by":"crossref","unstructured":"Jiang Y, Kong F, Ju X (2010) Lattice-based proxy signature. In: Proceedings of international conference on computational intelligence and security, pp 382\u2013385","DOI":"10.1109\/CIS.2010.88"},{"issue":"0","key":"843_CR26","first-page":"1","volume":"39","author":"L YU","year":"2013","unstructured":"YU L (2013) A lattice-based proxy signature scheme. Comput Eng 39(0):1\u20135","journal-title":"Comput Eng"},{"key":"843_CR27","doi-asserted-by":"crossref","unstructured":"Yang C, Qiu P, Zheng S, Wang L (2015) An efficient lattice-based proxy signature scheme without trapdoor. In: Proceedings of international conference on intelligent information hiding and multimedia signal processing","DOI":"10.1109\/IIH-MSP.2015.90"},{"key":"843_CR28","doi-asserted-by":"crossref","unstructured":"Ruckert M (2010) Lattice-based blind signatures. In: Proceedings of ASIACRYPT, pp 413\u2013430","DOI":"10.1007\/978-3-642-17373-8_24"},{"key":"843_CR29","doi-asserted-by":"crossref","unstructured":"Le HQ, Susilo W, Khuc TX, Bui MK, Duong DH (2019) A blind signature from module latices. In: Proceedings of IEEE conference on dependable and secure computing (DSC)","DOI":"10.1109\/DSC47296.2019.8937613"},{"key":"#cr-split#-843_CR30.1","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor C, Bettaieb S, Gaborit P, Schrek J (2013) A code-based undeniable signature scheme. In: Stam M","DOI":"10.1007\/978-3-642-45239-0_7"},{"key":"#cr-split#-843_CR30.2","unstructured":"(ed) Cryptography and coding. imacc 2013. lecture notes in computer science, vol 8308. Springer, Berlin"},{"issue":"12","key":"843_CR31","first-page":"260","volume":"4","author":"S Li","year":"2012","unstructured":"Li S, Wang C (2012) An undeniable signature scheme based on lattice. IJACT Int J Adv Comput Technol 4(12):260\u2013267","journal-title":"IJACT Int J Adv Comput Technol"},{"key":"843_CR32","doi-asserted-by":"crossref","unstructured":"Ajtai M (1999) Generating hard instances of the short basis problem. In: International colloquium on automata, languages and programming, pp 1\u20139","DOI":"10.1007\/3-540-48523-6_1"},{"key":"843_CR33","doi-asserted-by":"crossref","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: ACM Symposium on the theory of computing, pp 1\u201332","DOI":"10.1145\/237814.237838"},{"issue":"4","key":"843_CR34","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C (2016) Decade of lattice cryptography. Found Trends Theor Comput Sci World Sci 10 (4):283\u2013424","journal-title":"Found Trends Theor Comput Sci World Sci"},{"key":"843_CR35","doi-asserted-by":"crossref","unstructured":"Stern J (1994) A new identification scheme based on syndrome decoding. In: Proceeding of CRYPTO 1993. LNCS, vol 773. Springer, Heidelberg, pp 13\u201321","DOI":"10.1007\/3-540-48329-2_2"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-021-00843-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-021-00843-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-021-00843-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T08:17:15Z","timestamp":1647073035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-021-00843-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":36,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s12243-021-00843-1","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"18 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}