.png){kind=icon}
返回
A lattice-based signcryption scheme without random oracles
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-014-3163-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
signcryption
standard model
lattice-based cryptography
learning with errors problem
small integer solution problem
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
Exploring the optical limiting, photocatalytic and antibacterial properties of the BiFeO3–NaNbO3 nanocomposite system.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏分享收藏First-Principles Simulations of Liquid Water Using a Dielectric-Dependent Hybrid Functional使用介电相关的混合泛函对液态水进行第一性原理模拟
PREAI
分享收藏
查看更多内容