Lattice-Based Revocable Certificateless Signature

Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.

[1]  Ying-Hao Hung,et al.  A Revocable Certificateless Short Signature Scheme and Its Authentication Application , 2016, Informatica.

[2]  Fagen Li,et al.  Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model , 2013, Secur. Commun. Networks.

[3]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[4]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[5]  Gwoboa Horng,et al.  Certificateless Signatures: Structural Extensions of Security Models and New Provably Secure Schemes , 2013, IACR Cryptol. ePrint Arch..

[6]  Kenneth G. Paterson,et al.  CBE from CL-PKE: A Generic Construction and Efficient Schemes , 2005, Public Key Cryptography.

[7]  Kenneth G. Paterson,et al.  Certificateless Public Key Cryptography , 2003 .

[8]  Futai Zhang,et al.  A Revocable Certificateless Signature Scheme , 2014, J. Comput..

[9]  Vadim Lyubashevsky,et al.  Lattice Signatures Without Trapdoors , 2012, IACR Cryptol. ePrint Arch..

[10]  Chris Peikert,et al.  On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.

[11]  Sen-Shan Huang,et al.  Secure Certificateless Signature with Revocation in the Standard Model , 2014 .

[12]  Joseph K. Liu,et al.  Certificateless Public Key Encryption Secure against Malicious KGC Attacks in the Standard Model , 2007, IACR Cryptol. ePrint Arch..

[13]  Jean-Jacques Quisquater,et al.  On Constructing Certificateless Cryptosystems from Identity Based Encryption , 2006, Public Key Cryptography.

[14]  Oded Goldreich,et al.  Public-Key Cryptosystems from Lattice Reduction Problems , 1996, CRYPTO.

[15]  William Whyte,et al.  NTRUSIGN: Digital Signatures Using the NTRU Lattice , 2003, CT-RSA.

[16]  Miklós Ajtai,et al.  Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..

[17]  Daniele Micciancio,et al.  Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Yi Mu,et al.  Certificateless Signature Revisited , 2007, ACISP.

[19]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[20]  Sen-Shan Huang,et al.  Efficient revocable certificateless public key encryption with a delegated revocation authority , 2015, Secur. Commun. Networks.

[21]  Daniel J. Bernstein,et al.  Introduction to post-quantum cryptography , 2009 .

[22]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[23]  Vipul Goyal,et al.  Identity-based encryption with efficient revocation , 2008, IACR Cryptol. ePrint Arch..

[24]  Vadim Lyubashevsky,et al.  Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures , 2009, ASIACRYPT.

[25]  Jacques Stern,et al.  Security Arguments for Digital Signatures and Blind Signatures , 2015, Journal of Cryptology.

[26]  Xiang Xinyi,et al.  Adaptive Secure Revocable Identity-based Signature Scheme over Lattices , 2015 .

[27]  Léo Ducas,et al.  Efficient Identity-Based Encryption over NTRU Lattices , 2014, ASIACRYPT.

[28]  Liusheng Huang,et al.  Certificateless and certificate-based signatures from lattices , 2015, Secur. Commun. Networks.

[29]  Phong Q. Nguyen,et al.  Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures , 2009, Journal of Cryptology.

[30]  LiFagen,et al.  Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model , 2013 .

[31]  Yuh-Min Tseng,et al.  Efficient Revocable ID-Based Encryption with a Public Channel , 2012, Comput. J..

[32]  Ron Steinfeld,et al.  Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices , 2013, IACR Cryptol. ePrint Arch..

[33]  Liusheng Huang,et al.  Efficient Identity-Based Signature from Lattices , 2014, SEC.

[34]  Ying-Hao Hung,et al.  Revocable ID-Based Signature with Short Size over Lattices , 2017, Secur. Commun. Networks.

[35]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[36]  Ying-Hao Hung,et al.  Certificateless Signature with Strong Unforgeability in the Standard Model , 2015, Informatica.

[37]  Limin Shen,et al.  Efficient Revocable Certificateless Encryption Secure in the Standard Model , 2014, Comput. J..

[38]  Markus Rückert,et al.  Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles , 2010, PQCrypto.