Efficient Lattice-Based Signcryption in Standard Model
Efficient Lattice-Based Signcryption in Standard Model
复制标题
DOI：
10.1155/2013/702539
复制
发表时间：
2013-11
影响因子：
--
通讯作者：
Jianhua Yan;Licheng Wang;Lihua Wang;Yixian Yang;Wenbin Yao
中科院分区：
文献类型：
--
作者：
Jianhua Yan;Licheng Wang;Lihua Wang;Yixian Yang;Wenbin Yao
签密是一种加密原语，可以以显著降低的成本同时执行数字签名和公共加密。这一优势使其在许多应用程序中非常有用。然而，量子计算的蓬勃发展对现有的签密方案提出了严峻的挑战。作为后量子密码学领域一个有趣的垫脚石，最近提出了两个基于格的签密方案。但在随机预言模型中，这两种算法都只是被证明是安全的。因此，本文的主要贡献是提出了一种新的基于格的签密方案，该方案可以在标准模型下证明是安全的。
Signcryption is a cryptographic primitive that can perform digital signature and public encryption simultaneously at a significantly reduced cost. This advantage makes it highly useful in many applications. However, most existing signcryption schemes are seriously challenged by the booming of quantum computations. As an interesting stepping stone in the post-quantum cryptographic community, two lattice-based signcryption schemes were proposed recently. But both of them were merely proved to be secure in the random oracle models. Therefore, the main contribution of this paper is to propose a new lattice-based signcryption scheme that can be proved to be secure in the standard model.