A lattice-based signcryption scheme without random oracles  

作　　者：Xiuhua LU Qiaoyan WEN Zhengping JIN Licheng WANG Chunli YANG 

机构地区：[1]State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China [2]Mathematics and Information Science, Langfang Teachers University, Langfang 065000, China [3]Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China

出　　处：《Frontiers of Computer Science》2014年第4期667-675,共9页中国计算机科学前沿（英文版）

基　　金：This work was supported by the National Natural Science Foundation of China （Grant Nos. 61272057, 61202434, 61170270, 61100203, 61003286, 61121061）, the Fundamental Research Funds for the Central Universities （2012RC0612, 2011YB01）, Langfang Teachers University Youth Fund （LSZQ200804）, Hebei Education Funds for Youth Project （Q2012020, QN20131077）.

摘　　要：In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Information Sciences, 2012, 6（1）： 23-28] have independently extended the concept of signcryption to lattice-based cryptography. However, their schemes are only secure under the random or- acle model. In this paper, we present a lattice-based signcryp- tion scheme which is secure under the standard model. We prove that our scheme achieves indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the learning with errors （LWE） assumption and existential unforgeability against adaptive chosen-message attacks （EUF- CMA） under the small integer solution （SIS） assumption.In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Information Sciences, 2012, 6（1）： 23-28] have independently extended the concept of signcryption to lattice-based cryptography. However, their schemes are only secure under the random or- acle model. In this paper, we present a lattice-based signcryp- tion scheme which is secure under the standard model. We prove that our scheme achieves indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the learning with errors （LWE） assumption and existential unforgeability against adaptive chosen-message attacks （EUF- CMA） under the small integer solution （SIS） assumption.

关 键 词：SIGNCRYPTION standard model lattice-based cryptography learning with errors problem small integer solution problem 

分 类 号：O35[理学—流体力学] TP309[理学—力学]