Identity-Based Deterministic Proxy Re-Encryption Scheme on Lattice

Na Hua, Long Zhang, Kejia Zhang

Abstract: In the information age, it is necessary to improve the efficiency of data use and ensure the security and stability of data. This paper constructs an identity-based proxy re-encryption scheme based on the Learning with Rounding (LWR) problem on the lattice. The scheme uses the pre-image sampling technique to obtain the private key. When the message is encrypted, it is encrypted with a deterministic encryption algorithm. The algorithm encrypts each plaintext to generate a unique ciphertext, thereby improving the efficiency of encryption and decryption. In the proxy re-encryption scheme, the proxy is often semi-honest, so the homomorphic signature technology is introduced to detect whether the proxy calculates honestly and realize the verifiability of re-encryption. Finally, Honest Re-Encryption Attack (HRA) security, as an enhanced Chosen Plaintext Attack (CPA) security, can better capture the target of proxy re-encryption, enabling the constructed scheme to provide more robust security in practical applications.