ID-Based signatures from lattices in the random oracle model

Cryptosystems based on the hardness of lattice problems are becoming more and more popular in the research community. These kind of crypto schemes have many potential advantages: their resistance so far to cryptanalysis by quantum algorithms, their asymptotic efficiency and conceptual simplicity, and the guarantee that their random instances are as hard as the hardness of lattice problems in worst case. In this paper, we propose an ID-based signature scheme using lattices and then make some discussion on its extensions. The constructions use lattice basis delegation with fixed-dimension technique for extracting users' secret key, and the security can be reduced to the small integer solution problem (SIS) problem in the random oracle model.