期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
An Attribute-Based Signature Scheme from Lattice Assumption 被引量:4
1
作者 ZHANG Yanhua HU Yupu JIANG Mingming 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2015年第3期207-213,共7页
Inspired by the framework of Boyen, in this paper, an attribute-based signature(ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity's attributes set corresponds to t... Inspired by the framework of Boyen, in this paper, an attribute-based signature(ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity's attributes set corresponds to the concatenation of a lattice matrix with the sum of some random matrices, and the signature vector is generated by using the Preimage Sampling algorithm. Compared with current attribute-based signature schemes, this scheme can resist quantum attacks and enjoy shorter public-key, smaller signature size and higher efficiency. 展开更多
关键词 attribute-based signature lattice assumption small integer solution post-quantum cryptography high efficiency
原文传递
Post-quantum blind signcryption scheme from lattice 被引量:2
2
作者 Huifang YU Lu BAI 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2021年第6期891-901,共11页
Blind signcryption(BSC) can guarantee the blindness and untrackability of signcrypted messages, and moreover, it provides simultaneous unforgeability and confidentiality. Most traditional BSC schemes are based on the ... Blind signcryption(BSC) can guarantee the blindness and untrackability of signcrypted messages, and moreover, it provides simultaneous unforgeability and confidentiality. Most traditional BSC schemes are based on the number theory. However, with the rapid development of quantum computing, traditional BSC systems are faced with severe security threats. As promising candidate cryptosystems with the ability to resist attacks from quantum computing, lattice-based cryptosystems have attracted increasing attention in academic fields. In this paper, a post-quantum blind signcryption scheme from lattice(PQ-LBSCS) is devised by applying BSC to lattice-based cryptosystems. PQ-LBSCS inherits the advantages of the lattice-based cryptosystem and blind signcryption technique. PQ-LBSCS is provably secure under the hard assumptions of the learning with error problem and small integer solution problem in the standard model. Simulations are carried out using the Matlab tool to analyze the computational efficiency, and the simulation results show that PQ-LBSCS is more efficient than previous schemes. PQ-LBSCS has extensive application prospects in e-commerce, mobile communication, and smart cards. 展开更多
关键词 Lattice-based cryptosystem Blind signcryption Post-quantum computing Learning with error assumption small integer solution assumption
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部