格上的代理重签名方案

Proxy re-signature scheme over the lattice

For the proxy insecurity of the re-signature schemes based on large integer factorization and the discrete logarithm problem in quantum environment, we present a proxy re-signature scheme that can resist the quantum attack. Using Xagawa's proxy re-encryption technology and lattice signatures without trapdoors technology, we construct the first lattice-based proxy re-signature scheme. The security of this scheme is based on the hardness of the Small Integer Solution(SIS) problem. The results of the proof and efficiency analysis show that this scheme has the properties of bidirection, multi-use, optimal key and transparency. Compared with previous schemes relying on other hardness assumptions, it has the advantage of low asymptotic computational complexity. Finally, we extend the scheme to the identity-based proxy re-signature scheme.