A lattice-based signcryption scheme without random oracles

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 sig...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers of Computer Science 2014-08, Vol.8 (4), p.667-675
Main Authors: LU, Xiuhua, WEN, Qiaoyan, JIN, Zhengping, WANG, Licheng, YANG, Chunli
Format: Article
Language:English
Subjects:
Algorithms
Applications of mathematics
Computer Science
Cryptography
Digital signatures
Encryption
lattice-based cryptography
learning with errors problem
Research Article
signcryption
small integer solution problem
standard model
基础
安全性
应用数学
格子
签密方案
选择密文攻击
随机
预言
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 oracle model. In this paper, we present a lattice-based signcryption 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 (EUFCMA) under the small integer solution (SIS) assumption.
ISSN:2095-2228
2095-2236
DOI:10.1007/s11704-014-3163-1