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