一种基于格的高效签密方案的分析与设计
Analysis and Design of an Efficient Lattice-Based Signcryption Scheme
郑晓 1王茜 1鲁龙1
作者信息
- 1. 西华大学计算机与软件工程学院，成都 610039
- 折叠
摘要
签密是同时执行数字签名和公共密钥加密两种功能的一个加密原语，所需成本比通过传统的先签名后加密的方法低。设计一个一次发送长度为L消息的高效签密方案。并证明，该方案在错误学习假设下具有适应性选择密文攻击不可区分性（IND-CCA2)，在非均匀小整数解假设下具有适应性选择消息攻击强不可伪造性（SUF-CMA)。与基于数论假设方案相比，该方案具有密钥空间较大，但效率更高。
Abstract
Signcryption is a cryptographic primitive that performs simultaneously both the functions of digital signature and public-key encryption, at a cost significantly lower than that required by the traditional signature-then-encryption approach. Designs an efficient signcryption scheme that can send a message of length L one time. Proves that the proposed scheme has the indistinguishability against adaptive cho-sen ciphertext attacks under the learning with errors assumption and strong unforgeability against adaptive chosen messages attacks under the inhomogeneous small integer solution assumption inthe random oracle model. Compared with the schemes based on factoring or dis-crete log, the public and secret keys of the scheme are large, but it requires only linear operation on small integers.
关键词
格/随机预言机/签密Key words
Lattice/Random Oracle/Signcryption引用本文复制引用
出版年
2015
NETL
NSTL
维普
万方数据