Full Text:
<2900>
Summary: 
<1278>
CLC number: TP309
On-line Access: 2021-07-12
Received: 2020-03-07
Revision Accepted: 2020-09-07
Crosschecked: 2021-04-01
Cited: 0
Clicked: 4002
Post-quantum blind signcryption scheme from lattice
| ||||||||||||||
Huifang Yu, Lu Bai. Post-quantum blind signcryption scheme from lattice[J]. Frontiers of Information Technology & Electronic Engineering, 2021, 22(6): 891-901.
@article{title="Post-quantum blind signcryption scheme from lattice",
author="Huifang Yu, Lu Bai",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="22",
number="6",
pages="891-901",
year="2021",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2000099"
}
%0 Journal Article
%T Post-quantum blind signcryption scheme from lattice
%A Huifang Yu
%A Lu Bai
%J Frontiers of Information Technology & Electronic Engineering
%V 22
%N 6
%P 891-901
%@ 2095-9184
%D 2021
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2000099
TY - JOUR
T1 - Post-quantum blind signcryption scheme from lattice
A1 - Huifang Yu
A1 - Lu Bai
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 22
IS - 6
SP - 891
EP - 901
%@ 2095-9184
Y1 - 2021
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2000099
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.
[1]Ajtai M, 1996. Generating hard instances of lattice problems (extended abstract). Proc 28th Annual ACM Symp on Theory of Computing, p.99-108.
[2]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.
[3]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.
[4]Gerard F, Merckx K, 2018. Post-quantum signcryption from lattice-based signatures. J IACR Cryptol Eprint Arch, 9(15):56.
[5]Hoffstein J, Pipher J, Silverman JH, 1998. NTRU: a ring-based public key cryptosystem. Proc 3rd Int Algorithmic Number Theory Symp, p.267-288.
[6]Li FG, Bin Muhaya FT, Khan MK, et al., 2013. Lattice-based signcryption. Concurr Comput Pract Exp, 25(14):2112-2122.
[7]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.
[8]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).
[9]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.
[10]Okamoto T, 2006. Efficient blind and partially blind signatures without random oracles. Proc 3rd Theory of Cryptography Conf, p.80-99.
[11]Regev O, 2009. On lattices, learning with errors, random linear codes, and cryptography. J ACM, 56(6):34.
[12]Sato S, Shikata J, 2018. Lattice-based signcryption without random oracles. Proc 9th Int Conf on Post-Quantum Cryptography, p.331-351.
[13]Sun YR, Zheng WM, 2018. An identity-based ring signcryption scheme in ideal lattice. J Netw Intell, 3(3):152-161.
[14]Tian HB, Zhang FG, Wei BD, 2016. A lattice-based partially blind signature. J Secur Commun Netw, 9(12):1820-1828.
[15]Yan JH, 2015. Research on Key Technologies of Lattices Signcryption. PhD Thesis, Beijing University of Posts and Telecommunications, Beijing, China (in Chinese).
[16]Yan JH, Wang LC, Li WH, et al., 2013. Efficient lattice-based signcryption in standard model. Math Probl Eng, 2013:702539.
[17]Yan JH, Wang LC, Dong MX, et al., 2015. Identity-based signcryption from lattices. Secur Commun Netw, 8(18):3751-3770.
[18]Yan JH, Wang LC, Li MZ, et al., 2019. Attribute-based signcryption from lattices in the standard model. IEEE Access, 7(1):56039-56050.
[19]Yang XP, Cao H, Li WC, et al., 2019. Improved lattice-based signcryption in the standard model. IEEE Access, 7:155552-155562.
[20]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.
[21]Yu HF, Wang ZC, 2019. Certificateless blind signcryption with low complexity. IEEE Access, 7:115181-115191.
[22]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.
[23]Zia M, Ali R, 2019. Cryptanalysis and improvement of blind signcryption scheme based on elliptic curve. Electron Lett, 55(8):457-459.
ORCID: 
Open peer comments: Debate/Discuss/Question/Opinion
<1>