Journal of Information Engineering University
Approximate Smooth Projective Hash Functions from Ideal Lattices
Wenfen Liu
Abstract
An approximate smooth projective hash(ASPH) function is an important primitive of the lattice-based cryptography,and it is used to construct password-based authenticated key exchange(PAKE) protocol which is resistant to quantum attacks by Katz et al.The available ASPH function based on the hardness of the standard lattice problem has a large key size and impractical implementations.Based on learning with error problem from ideal lattices(R-LWE),this paper designs a new public-key encryption scheme and an associated ASPH function that can apply to PAKE protocol,and gives a proof of its security.Compared with the existing system,the new system has a small key size,fast computing speed and high efficiency.