Abstract
In this paper, we propose a lattice-based undeniable signature where security is based on the hardness of the ISIS problem. The security requirements for an undeniable signature scheme are clearly described, and the proposed scheme is proved to enjoy completeness, soundness, unforgeability, and invisibility properties.
Similar content being viewed by others
References
Chaum D, van Antwerpen H (1990) Undeniable signatures. In: Proceeding of CRYPTO 1989. LNCS, vol 435. Springer, Heidelberg, pp 212–216
Boyar J, Chaum D, Damgard I, Pedersen T (1991) Convertible undeniable signatures. In: Prodeecing of CRYPTO 1990. LNCS, vol 537. Springer, Heidelberg, pp 189–205
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–484
Damgard I, Pedersen T (1996) New convertible undeniable signature schemes. In: Prodeecing of EUROCRYPT 1996. LNCS, vol 1070. Springer, Heidelberg, pp 372–386
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–97
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–217
Gennaro R, Rabin T, Krawczyk H (2000) RSA-based undeniable signatures. J. Cryptol. 13(4):397–416
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–443
Ogata W, Kurosawa K, Heng S (2006) The security of the FDH variant of Chaum’s undeniable signature scheme. IEEE Trans Inf Theory 52(5):2006–2017
Laguillaumie F, Vergnaud D (2005) Short undeniable signatures without oracles: random the missing link. In: Proceeding of - INDOCRYPT 2005. Springer, Berlin, pp 283–296
Tang CM, Zhao YM (2006) Identity-based undeniable signatures from bilinear pairings. Shenzhen Daxue Xuebao 23(1):85–89
Schuldt JCN, Matsuura K (2009) An efficient convertible undeniable signature scheme with delegatable verification. Lect Notes Comput Sci 6047:276–293
Zhao W, Ye D (2012) Certificateless undeniable signatures from bilinear maps. Inform Sci 199(16):204–215
Aboud SJ (2014) Secure undeniable threshold proxy signature scheme. Int J Adv Comput Sci & Appl 5(1):63–68
Ogata W, Kurosawa K, Heng SH (2017) The security of the FDH variant of Chaum’s undeniable signature scheme. IEEE Trans Inf Theory 52(5):2006–2017
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–206
Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Proceedings of EUROCRYPT, pp 238–275
Gordon SD, Katz J, Vaikuntanathan V (2010) A group signature scheme from lattice assumptions. In: Proceedings of ASIACRYPT 2010, pp 395–412
Ling S, Nguyen K, Wang H, Xu Y (2018) Constant-size group signatures from lattices. In: Abdalla M, Dahab R (eds) Public-Key Cryptography – PKC 2018. LNCS (10770), pp 58–88
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–94
Wang J, Sun B (2011) Ring signature scheme from lattice basis delegation. In: Proceedings of ICICS, pp 15–28
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–576. Springer
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
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
Jiang Y, Kong F, Ju X (2010) Lattice-based proxy signature. In: Proceedings of international conference on computational intelligence and security, pp 382–385
YU L (2013) A lattice-based proxy signature scheme. Comput Eng 39(0):1–5
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
Ruckert M (2010) Lattice-based blind signatures. In: Proceedings of ASIACRYPT, pp 413–430
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)
Aguilar-Melchor C, Bettaieb S, Gaborit P, Schrek J (2013) A code-based undeniable signature scheme. In: Stam M (ed) Cryptography and coding. imacc 2013. lecture notes in computer science, vol 8308. Springer, Berlin
Li S, Wang C (2012) An undeniable signature scheme based on lattice. IJACT Int J Adv Comput Technol 4(12):260–267
Ajtai M (1999) Generating hard instances of the short basis problem. In: International colloquium on automata, languages and programming, pp 1–9
Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: ACM Symposium on the theory of computing, pp 1–32
Peikert C (2016) Decade of lattice cryptography. Found Trends Theor Comput Sci World Sci 10 (4):283–424
Stern J (1994) A new identification scheme based on syndrome decoding. In: Proceeding of CRYPTO 1993. LNCS, vol 773. Springer, Heidelberg, pp 13–21
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethics approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Conflict of interest
The authors declare no competing interests.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Rawal, S., Padhye, S. & He, D. Lattice-based undeniable signature scheme. Ann. Telecommun. 77, 119–126 (2022). https://doi.org/10.1007/s12243-021-00843-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-021-00843-1