后量子安全的格盲签密方案

俞惠芳; 白璐

doi:10.1631/FITEE.2000099

Your Location：

Home >

Browse articles >

后量子安全的格盲签密方案

常规文章 | Updated：2022-06-06

- 后量子安全的格盲签密方案
- Post-quantum blind signcryption scheme from lattice
- 信息与电子工程前沿（英文） 2021年22卷第6期页码：891-901
- Affiliations：
  
  School of Cyberspace Security, Xi'an University of Posts and Telecommunications, Xi'an 710121, China
- Author bio：
  
  YU Huifang, E-mail: yuhuifang@xupt.edu.cn
- Funds：
  
  Project supported by the Key Project of Natural Science Foundation Basic Research Program of Shaanxi Province, China (No. 2020JZ-54) and the Innovation Foundation of Postgraduate of Xi'an University of Posts and Telecommunications, China (No. CXJJLY2018075)
- DOI：10.1631/FITEE.2000099
  中图分类号： TP309
- 收稿：2020-03-07，
  
  修回：2021-;4-;1，
  
  纸质出版：2021-06
- Accepted：
Scan QR Code
俞惠芳, 白璐. 后量子安全的格盲签密方案[J]. 信息与电子工程前沿（英文）, 2021,22(6):891-901.

Huifang YU, Lu BAI. Post-quantum blind signcryption scheme from lattice[J]. Frontiers of Information Technology & Electronic Engineering, 2021, 22(6): 891-901.
俞惠芳, 白璐. 后量子安全的格盲签密方案[J]. 信息与电子工程前沿（英文）, 2021,22(6):891-901. DOI： 10.1631/FITEE.2000099.

Huifang YU, Lu BAI. Post-quantum blind signcryption scheme from lattice[J]. Frontiers of Information Technology & Electronic Engineering, 2021, 22(6): 891-901. DOI： 10.1631/FITEE.2000099.

摘要

盲签密能够保证签密消息的盲性和不可追踪性，可以同时实现盲签名和公钥加密。大多数盲签密都是基于传统数论问题。随着量子计算技术的发展，传统盲签密面临着严峻的安全威胁。作为有前途的抗量子计算候选密码系统，格密码系统在学术领域引起越来越多关注。本文通过将盲签密应用于格密码系统，提出一种后量子安全的格盲签密方案（PQ-LBSCS）。PQ-LBSCS具有格密码体制和盲签密技术的优点。在标准模型中PQ-LBSCS基于带错误学习问题和小整数解问题被证明是安全的。Matlab仿真结果表明PQ-LBSCS比已有方案更高效。PQ-LBSCS安全性强、计算效率高，使其在电子商务、移动通信、智能卡等领域具有广泛应用前景。

Abstract

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.

关键词

Keywords

references

M Ajtai . . Generating hard instances of lattice problems (extended abstract) . . Proc 28 th Annual ACM Symp on Theory of Computing , , 1996 . . p 99 - - 108 . . DOI: 10.1145/237814.237838 http://doi.org/10.1145/237814.237838 . .

M Ajtai , , , C Dwork . . A public-key cryptosystem with worst-case/average-case equivalence . . Proc 29 th Annual ACM Symp on Theory of Computing , , 1997 . . p 284 - - 293 . . DOI: 10.1145/258533.258604 http://doi.org/10.1145/258533.258604 . .

S Garg , , , C Gentry , , , S Halevi . . Candidate multilinear maps from ideal lattices . . Proc 32 nd Annual Int Conf on the Theory and Applications of Cryptographic Techniques , , 2013 . . p 1 - - 17 . . DOI: 10.1007/978-3-642-38348-9_1 http://doi.org/10.1007/978-3-642-38348-9_1 . .

F Gerard , , , K Merckx . . Post-quantum signcryption from lattice-based signatures . . J IACR Cryptol Eprint Arch , , 2018 . . 9 ( ( 15 ): ): 56 . .

J Hoffstein , , , J Pipher , , , JH Silverman . . NTRU: a ring-based public key cryptosystem . . Proc 3 rd Int Algorithmic Number Theory Symp , , 1998 . . p 267 - - 288 . . DOI: 10.1007/BFb0054868 http://doi.org/10.1007/BFb0054868 . .

FG Li , , , Muhaya FT Bin , , , MK Khan , , , 等 . . Lattice-based signcryption . . Concurr Comput Pract Exp , , 2013 . . 25 ( ( 14 ): ): 2112 - - 2122 . . DOI: 10.1002/cpe.2826 http://doi.org/10.1002/cpe.2826 . .

Z Liu , , , YL Han , , , XY Yang . . A signcryption scheme based learning with errors over rings without trapdoor . . Proc 37 th National Conf of Theoretical Computer Science , , 2019 . . p 168 - - 180 . . DOI: 10.1007/978-981-15-0105-0_11 http://doi.org/10.1007/978-981-15-0105-0_11 . .

XH Lu , , , QY Wen , , , LC Wang , , , 等 . . A lattice-based signcryption scheme without trapdoors . . J Electron Inform Technol , , 2016 . . 38 ( ( 9 ): ): 2287 - - 2293 . . DOI: 10.11999/JEIT151044 http://doi.org/10.11999/JEIT151044 . .

D Micciancio , , , C Peikert . . Trapdoors for lattices: simpler, tighter, faster, smaller . . In: Pointcheval D, Johansson T (Eds.), Advances in Cryptology-EUROCRYPT. Springer, Berlin, Heidelberg, Germany , , 2012 . . p 700 - - 718 . . DOI: 10.1007/978-3-642-29011-4_41 http://doi.org/10.1007/978-3-642-29011-4_41 . .

T Okamoto . . Efficient blind and partially blind signatures without random oracles . . Proc 3 rd Theory of Cryptography Conf , , 2006 . . p 80 - - 99 . . DOI: 10.1007/11681878_5 http://doi.org/10.1007/11681878_5 . .

O Regev . . On lattices, learning with errors, random linear codes, and cryptography . . J ACM , , 2009 . . 56 ( ( 6 ): ): 34 DOI: 10.1145/1568318.1568324 http://doi.org/10.1145/1568318.1568324 . .

S Sato , , , J Shikata . . Lattice-based signcryption without random oracles . . Proc 9 th Int Conf on Post-Quantum Cryptography , , 2018 . . p 331 - - 351 . . DOI: 10.1007/978-3-319-79063-3_16 http://doi.org/10.1007/978-3-319-79063-3_16 . .

YR Sun , , , WM Zheng . . An identity-based ring signcryption scheme in ideal lattice . . J Netw Intell , , 2018 . . 3 ( ( 3 ): ): 152 - - 161 . . . .

HB Tian , , , FG Zhang , , , BD Wei . . A lattice-based partially blind signature . . J Secur Commun Netw , , 2016 . . 9 ( ( 12 ): ): 1820 - - 1828 . . DOI: 10.1002/sec.1439 http://doi.org/10.1002/sec.1439 . .

JH Yan . . Research on Key Technologies of Lattices Signcryption , , : : Beijing, China PhD Thesis, Beijing University of Posts and Telecommunications , , 2015 . . .

JH Yan , , , LC Wang , , , WH Li , , , 等 . . Efficient lattice-based signcryption in standard model . . Math Probl Eng , , 2013 . . 2013 702539 DOI: 10.1155/2013/702539 http://doi.org/10.1155/2013/702539 . .

JH Yan , , , LC Wang , , , MX Dong , , , 等 . . Identity-based signcryption from lattices . . Secur Commun Netw , , 2015 . . 8 ( ( 18 ): ): 3751 - - 3770 . . DOI: 10.1002/sec.1297 http://doi.org/10.1002/sec.1297 . .

JH Yan , , , LC Wang , , , MZ Li , , , 等 . . Attribute-based signcryption from lattices in the standard model . . IEEE Access , , 2019 . . 7 ( ( 1 ): ): 56039 - - 56050 . . DOI: 10.1109/ACCESS.2019.2900003 http://doi.org/10.1109/ACCESS.2019.2900003 . .

XP Yang , , , H Cao , , , WC Li , , , 等 . . Improved lattice-based signcryption in the standard model . . IEEE Access , , 2019 . . 7 155552 - - 155562 . . DOI: 10.1109/ACCESS.2019.2949429 http://doi.org/10.1109/ACCESS.2019.2949429 . .

Q Ye , , , J Zhou , , , YL Tang . . Partial blind signature scheme based on identity-based anti-quantum attack . . J Inform Netw Secur , , 2018 . . 5 ( ( 3 ): ): 46 - - 53 . . . .

HF Yu , , , ZC Wang . . Certificateless blind signcryption with low complexity . . IEEE Access , , 2019 . . 7 115181 - - 115191 . . DOI: 10.1109/ACCESS.2019.2935788 http://doi.org/10.1109/ACCESS.2019.2935788 . .

TH Yuen , , , VK Wei . . Fast and proven secure blind identity-based signcryption from pairings . . Proc Cryptographers' Track at the RSA Conf , , 2005 . . p 305 - - 322 . . DOI: 10.1007/978-3-540-30574-3_21 http://doi.org/10.1007/978-3-540-30574-3_21 . .

M Zia , , , R Ali . . Cryptanalysis and improvement of blind signcryption scheme based on elliptic curve . . Electron Lett , , 2019 . . 55 ( ( 8 ): ): 457 - - 459 . . DOI: 10.1049/el.2019.0032 http://doi.org/10.1049/el.2019.0032 . .

浏览量

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

暂无数据