|Title||NTRUReEncrypt: An Efficient Proxy Re-Encryption Scheme Based on NTRU|
|Publication Type||Conference Paper|
|Year of Publication||2015|
|Authors||D. Nuñez, I. Agudo, and J. Lopez|
|Conference Name||10th ACM Symposium on Information, Computer and Communications Security (AsiaCCS)|
The use of alternative foundations for constructing more secure and efficient cryptographic schemes is a topic worth exploring. In the case of proxy re-encryption, the vast majority of schemes are based on number theoretic problems such as the discrete logarithm. In this paper we present NTRUReEncrypt, a new bidirectional and multihop proxy re-encryption scheme based on NTRU, a widely known lattice-based cryptosystem. We provide two versions of our scheme: the first one is based on the conventional NTRU encryption scheme and, although it lacks a security proof, remains as efficient as its predecessor; the second one is based on a variant of NTRU proposed by Stehlé and Steinfeld, which is proven CPA-secure under the hardness of the Ring-LWE problem. To the best of our knowledge, our proposals are the first proxy re-encryption schemes to be based on the NTRU primitive. In addition, we provide experimental results to show the efficiency of our proposal, as well as a comparison with previous proxy re-encryption schemes, which confirms that our first scheme outperforms the rest by an order of magnitude.
NTRUReEncrypt: An Efficient Proxy Re-Encryption Scheme Based on NTRU