无陷门格基签密方案  

A Lattice-based Signcryption Scheme Without Trapdoors

作　　者：路秀华[1,2] 温巧燕[2] 王励成[3] 杜蛟[4] 

机构地区：[1]廊坊师范学院数学与信息科学学院,廊坊065000 [2]北京邮电大学网络与交换技术国家重点实验室,北京100876 [3]北京邮电大学信息安全中心,北京100876 [4]河南师范大学数学与信息科学学院,新乡453007

出　　处：《电子与信息学报》2016年第9期2287-2293,共7页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(61300181;61502044;61402015;U1404601;11471104);中央高校基本科研业务费专项资金(2015RC23);河北省教育厅青年基金(QN2015084);廊坊市科技局项目(2015011063);廊坊师范学院博士基金(LSLB201408)~~

摘　　要：现有的格基签密方案以陷门产生算法和原像取样算法为核心算法。但是,这两个算法都很复杂,运算量较大,严重影响格基签密方案的执行效率。该文运用无陷门格基签名及其签名压缩技术,结合基于带错学习问题的加密方法,提出第1个基于格理论的、不依赖于陷门产生算法和原像取样算法的签密方案。方案在带错学习问题和小整数解问题的难解性假设下,达到了自适应选择密文攻击下的不可区分性和自适应选择消息攻击下的不可伪造性。方案在抗量子攻击的同时,保证了较高的执行效率。The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.

关 键 词：基于格的密码学 签密 无陷门格基签名 带错学习问题 小整数解问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]