ISSN 1000-1239 CN 11-1777/TP

Journal of Computer Research and Development ›› 2021, Vol. 58 ›› Issue (3): 583-597.doi: 10.7544/issn1000-1239.2021.20200321

Previous Articles     Next Articles

Lattice-Based Forward Secure Proxy Signatures

Xie Jia1, Hu Yupu2, Jiang Mingming3   

  1. 1(College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou 450046);2(State Key Laboratory of Integrated Services Networks(Xidian University), Xi’an 710071);3(College of Computer Science and Technology, Huaibei Normal University, Huaibei, Anhui 235000)
  • Online:2021-03-01
  • Supported by: 
    This work was supported by the National Natural Science Foundation of China for Young Scientists (61802110, 61702161), the Key Research and Development and Promotion Program of Henan Province (Science and Technology) (202102310195), and the Key Research Found for Higher Education of Henan Province (19A413005, 18A520003).

Abstract: With advantages of both forward security and proxy, the forward secure proxy signature has been widely applied in mobile communication and electronic auction since it was proposed. However, most of the existing forward secure proxy signatures are based on the classic number theory problem, such as the problem of discrete logarithms and the problem of factorization, which are no longer secure when the general quantum computers become a reality. So looking for the quantum-immune forward secure proxy signature is much urgent. Among the four quantum-immune public key cryptographies, lattice-based cryptography enters a rapid development period in the last ten years and has got many achievements, having the advantages of quantum-immune, computing simply and efficiently, and the worst-case to average-case security guarantees. In this paper, we firstly introduce the concept and the security model of forward secure proxy signature in lattice-based cryptography, and propose two forward secure proxy lattice-based signature schemes based on the small integer solution problem, which is the NP-hard problem. One is the first lattice-based forward proxy signature in the random oracle model, which is proven secure against the polynomial time adversary(both of the unauthorized proxy signer and the malicious original signer). And the forward security is satisfied at the expense of efficiency. The other is proven unforgeable and forward secure in the standard model, which is also the first lattice-based attempt in the standard model.

Key words: lattice, forward secure, proxy, signature, unforgeable

CLC Number: