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.
摘要
盲签密能够保证签密消息的盲性和不可追踪性, 可以同时实现盲签名和公钥加密. 大多数盲签密都是基于传统数论问题. 随着量子计算技术的发展, 传统盲签密面临着严峻的安全威胁. 作为有前途的抗量子计算候选密码系统, 格密码系统在学术领域引起越来越多关注. 本文通过将盲签密应用于格密码系统, 提出一种后量子安全的格盲签密方案 (PQ-LBSCS). PQ-LBSCS具有格密码体制和盲签密技术的优点. 在标准模型中PQ-LBSCS基于带错误学习问题和小整数解问题被证明是安全的. Matlab仿真结果表明PQ-LBSCS比已有方案更高效. PQ-LBSCS安全性强、 计算效率高, 使其在电子商务、 移动通信、 智能卡等领域具有广泛应用前景.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ajtai M, 1996. Generating hard instances of lattice problems (extended abstract). Proc 28th Annual ACM Symp on Theory of Computing, p.99–108. https://doi.org/10.1145/237814.237838
Ajtai M, Dwork C, 1997. A public-key cryptosystem with worst-case/average-case equivalence. Proc 29th Annual ACM Symp on Theory of Computing, p.284–293. https://doi.org/10.1145/258533.258604
Garg S, Gentry C, Halevi S, 2013. Candidate multilinear maps from ideal lattices. Proc 32nd Annual Int Conf on the Theory and Applications of Cryptographic Techniques, p.1–17. https://doi.org/10.1007/978-3-642-38348-9_1
Gerard F, Merckx K, 2018. Post-quantum signcryption from lattice-based signatures. J IACR Cryptol Eprint Arch, 9(15):56.
Hoffstein J, Pipher J, Silverman JH, 1998. NTRU: a ring-based public key cryptosystem. Proc 3rd Int Algorithmic Number Theory Symp, p.267–288. https://doi.org/10.1007/BFb0054868
Li FG, Bin Muhaya FT, Khan MK, et al., 2013. Lattice-based signcryption. Concurr Comput Pract Exp, 25(14):2112–2122. https://doi.org/10.1002/cpe.2826
Liu Z, Han YL, Yang XY, 2019. A signcryption scheme based learning with errors over rings without trapdoor. Proc 37th National Conf of Theoretical Computer Science, p.168–180. https://doi.org/10.1007/978-981-15-0105-0_11
Lu XH, Wen QY, Wang LC, et al., 2016. A lattice-based signcryption scheme without trapdoors. J Electron Inform Technol, 38(9):2287–2293 (in Chinese). https://doi.org/10.11999/JEIT151044
Micciancio D, Peikert C, 2012. Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval D, Johansson T (Eds.), Advances in Cryptology-EUROCRYPT. Springer, Berlin, Heidelberg, Germany, p.700–718. https://doi.org/10.1007/978-3-642-29011-4_41
Okamoto T, 2006. Efficient blind and partially blind signatures without random oracles. Proc 3rd Theory of Cryptography Conf, p.80–99. https://doi.org/10.1007/11681878_5
Regev O, 2009. On lattices, learning with errors, random linear codes, and cryptography. J ACM, 56(6):34. https://doi.org/10.1145/1568318.1568324
Sato S, Shikata J, 2018. Lattice-based signcryption without random oracles. Proc 9th Int Conf on Post-Quantum Cryptography, p.331–351. https://doi.org/10.1007/978-3-319-79063-3_16
Sun YR, Zheng WM, 2018. An identity-based ring signcryption scheme in ideal lattice. J Netw Intell, 3(3):152–161.
Tian HB, Zhang FG, Wei BD, 2016. A lattice-based partially blind signature. J Secur Commun Netw, 9(12):1820–1828. https://doi.org/10.1002/sec.1439
Yan JH, 2015. Research on Key Technologies of Lattices Signcryption. PhD Thesis, Beijing University of Posts and Telecommunications, Beijing, China (in Chinese).
Yan JH, Wang LC, Li WH, et al., 2013. Efficient lattice-based signcryption in standard model. Math Probl Eng, 2013:702539. https://doi.org/10.1155/2013/702539
Yan JH, Wang LC, Dong MX, et al., 2015. Identity-based signcryption from lattices. Secur Commun Netw, 8(18): 3751–3770. https://doi.org/10.1002/sec.1297
Yan JH, Wang LC, Li MZ, et al., 2019. Attribute-based signcryption from lattices in the standard model. IEEE Access, 7(1):56039–56050. https://doi.org/10.1109/ACCESS.2019.2900003
Yang XP, Cao H, Li WC, et al., 2019. Improved lattice-based signcryption in the standard model. IEEE Access, 7:155552–155562. https://doi.org/10.1109/ACCESS.2019.2949429
Ye Q, Zhou J, Tang YL, 2018. Partial blind signature scheme based on identity-based anti-quantum attack. J Inform Netw Secur, 5(3):46–53.
Yu HF, Wang ZC, 2019. Certificateless blind signcryption with low complexity. IEEE Access, 7:115181–115191. https://doi.org/10.1109/ACCESS.2019.2935788
Yuen TH, Wei VK, 2005. Fast and proven secure blind identity-based signcryption from pairings. Proc Cryptographers’ Track at the RSA Conf, p.305–322. https://doi.org/10.1007/978-3-540-30574-3_21
Zia M, Ali R, 2019. Cryptanalysis and improvement of blind signcryption scheme based on elliptic curve. Electron Lett, 55(8):457–459. https://doi.org/10.1049/el.2019.0032
Author information
Authors and Affiliations
Contributions
Huifang YU designed the research. Huifang YU and Lu BAI processed the data. Lu BAI drafted the manuscript. Huifang YU helped organize the manuscript. Huifang YU and Lu BAI revised and finalized the paper.
Corresponding author
Ethics declarations
Huifang YU and Lu BAI declare that they have no conflict of interest.
Additional information
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)
Rights and permissions
About this article
Cite this article
Yu, H., Bai, L. Post-quantum blind signcryption scheme from lattice. Front Inform Technol Electron Eng 22, 891–901 (2021). https://doi.org/10.1631/FITEE.2000099
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/FITEE.2000099
Key words
- Lattice-based cryptosystem
- Blind signcryption
- Post-quantum computing
- Learning with error assumption
- Small integer solution assumption