无陷门格基签密方案

路秀华; 温巧燕; 王励成; 杜蛟

doi:10.11999/JEIT151044

无陷门格基签密方案

doi: 10.11999/JEIT151044

基金项目:

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

计量
- 文章访问数: 1555
- HTML全文浏览量: 262
- PDF下载量: 431
- 被引次数: 0
出版历程
- 收稿日期: 2015-09-14
- 修回日期: 2016-06-27
- 刊出日期: 2016-09-19

A Lattice-based Signcryption Scheme Without Trapdoors

Funds:

The National Natural Science Foundation of China (61300181, 61502044, 61402015, U1404601, 11471104), The Fundamental Research Funds for the Central Universities (2015RC23), Hebei Province Education Funds for Youth Project (QN2015084), Langfang Municipal Science and Technology Support Program (2015011063), Langfang Teachers University Doctor Funds (LSLB201408)

摘要

摘要: 现有的格基签密方案以陷门产生算法和原像取样算法为核心算法。但是，这两个算法都很复杂，运算量较大，严重影响格基签密方案的执行效率。该文运用无陷门格基签名及其签名压缩技术，结合基于带错学习问题的加密方法，提出第1个基于格理论的、不依赖于陷门产生算法和原像取样算法的签密方案。方案在带错学习问题和小整数解问题的难解性假设下，达到了自适应选择密文攻击下的不可区分性和自适应选择消息攻击下的不可伪造性。方案在抗量子攻击的同时，保证了较高的执行效率。
- 基于格的密码学 /
- 签密 /
- 无陷门格基签名 /
- 带错学习问题 /
- 小整数解问题
Abstract: 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.
- Lattice-based cryptography /
- Signcryption /
- Lattice signatures without trapdoors /
- Learning with errors problem /
- Small integer solution problem

HTML全文

参考文献(17)

ZHENG Y. Digital signcryption or how to achieve cost (signature+encryption)cost(signature)+cost(encryption) [C]. CRYPTO 1997, California, USA, 1997: 165-179.

MALONE-LEE J and MAO W. Two birds one stone: signcryption using rsa[C]. Proceedings of the 2003 RSA conference on The Cryptographers track, San Francisco, USA, 2003: 211-226.

LI Fagen and TAKAGI T. Secure identity-based signcryption in the standard model[J]. Mathematical and Computer Modelling, 2013, 57(11/12): 2685-2694.

LU Y and LI J. Efficient certificate-based signcryption secure against public key replacement attacks and insider attacks[J]. The Scientific World Journal, 2014, Article ID 295419.

Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.

杨孝鹏, 马文平, 张成丽. 一种新型基于环上带误差学习问题的认证密钥交换方案[J]. 电子与信息学报, 2015, 37(8): 1984-1988.

YANG Xiaopeng, MA Wenping, and ZHANG Chengli. New authenticated key exchange scheme based on ring learning with errors problem[J]. Journal of Electronics Information Technology, 2015, 37(8): 1984-1988.

张彦华, 胡予濮, 江明明, 等. 格上可撤销的基于身份的适应性安全的加密方案[J]. 电子与信息学报, 2015, 37(2): 423-428.

ZHANG Yanhua, HU Yupu, JIANG Mingming, et al. A lattice-based revocable adaptive-id secure encryption scheme [J]. Journal of Electronics Information Technology, 2015, 37(2): 423-428.

WANG Fenghe, HU Yupu, and WANG Chunxiao. Post- quantum secure hybrid signcryption from lattice assumption[J]. Applied Mathematics Information Sciences, 2012, 6(1): 23-28.

LI Fagen, BIN MUHAVA F T, KHAN M K, et al. Lattice-based signcryption[J]. Concurrency and Computation: Practice and Experience, 2013, 25(14): 2112-2122.

YAN Jianhua, WANG Licheng, YANG Yixian, et al. Efficient lattice-based signcryption in standard model[J]. Mathematical Problems in Engineering, 2013, Article ID 702539.

LU Xiuhua, WEN Qiaoyan, JIN Zhengping, et al. A lattice- based signcryption scheme without random oracles[J]. Frontiers of Computer Science, 2014, 8(4): 667-675.

LYUBASHEVSKY V. Lattice signatures without trapdoors [C]. EUROCRYPT 2012, Cambridge, USA, 2012: 738-755.

BAI Shi and GALBRAITH S D. An improved compression technique for signatures based on learning with errors[C]. CT-RSA 2014, San Francisco, USA, 2014: 28-47.

FUJISAKI E and OKAMOTO T. Secure integration of asymmetric and symmetric encryption schemes[J]. Journal of Cryptology, 2013, 26(1): 80-101.

BELLARE M and NEVEN G. Multi-signatures in the plain public-key model and a general forking lemma[C]. Proceedings of the 13th ACM Conference on Computer and Communications Security, Alexandria, USA, 2006: 390-399.

施引文献

资源附件(0)

访问统计