JUCS - Journal of Universal Computer Science 25(3): 282-293, doi: 10.3217/jucs-025-03-0282

An Identity-Based Signcryption on Lattice without Trapdoor

Xianmin Wang^‡, Yu Zhang^§, Brij Bhooshan Gupta^|, Hongfei Zhu^¶, Dongxi Liu^#

‡ Guangzhou University, Guangzhou, China§ School of Electrical and Information Engineering, Beijing, China| National Institute of Technology, Kurukshetra, India¶ Beijing Institute of Technology, Beijing, China# CSIRO, Sydney, Australia

Corresponding author: Xianmin Wang ( xianmin@gzhu.edu.cn )

This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY-ND 4.0). This license allows reusers to copy and distribute the material in any medium or format in unadapted form only, and only so long as attribution is given to the creator. The license allows for commercial use.

Citation: Wang X, Zhang Y, Gupta BB, Zhu H, Liu D (2019) An Identity-Based Signcryption on Lattice without Trapdoor. JUCS - Journal of Universal Computer Science 25(3): 282-293. https://doi.org/10.3217/jucs-025-03-0282

Abstract

Identity-based signcryption schemes based on large integer factorization and discrete logarithm problems were considered to be insecure for the quantum computer attack. Thus, choosing a quantum-resist platform and constructing secure schemes based on new hard assumptions are challenges. In this paper, we propose an alternative scheme - an identity-based signcryption on lattice, which does not need to rely on a trapdoor. Meanwhile, our scheme achieves IND-CCA2 and sUF-CMA security, and it is also secure against the current quantum algorithm attacks based on LWE problem for lattice. Furthermore, we demonstrate that the newly proposed scheme has much shorter secret key size, and higher speeds in signcryption and unsigncryption stages, compared with some exiting identity-based signcryption schemes.

Keywords

identity based signcryption, quantum attack, lattice, unforgeability