Lattice-Based Revocable Certificateless Signature
AbstractCertificateless 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. View Full-Text
Share & Cite This Article
Hung, Y.-H.; Tseng, Y.-M.; Huang, S.-S. Lattice-Based Revocable Certificateless Signature. Symmetry 2017, 9, 242.
Hung Y-H, Tseng Y-M, Huang S-S. Lattice-Based Revocable Certificateless Signature. Symmetry. 2017; 9(10):242.Chicago/Turabian Style
Hung, Ying-Hao; Tseng, Yuh-Min; Huang, Sen-Shan. 2017. "Lattice-Based Revocable Certificateless Signature." Symmetry 9, no. 10: 242.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.