David Nuñez
ABSTRACT
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.
- Java implementation of NTRUEncrypt and NTRUSign. http://tbuktu.github.io/ntru/.Google Scholar
- ANSI X9.98: Lattice-based polynomial public key establishment algorithm for the financial services industry. Technical report, ANSI, 2010.Google Scholar
- C. Aguilar-Melchor and P. Gaborit. A lattice-based computationally-efficient private information retrieval protocol. Cryptol. ePrint Arch., Report, 446, 2007.Google Scholar
- Y. Aono, X. Boyen, L. T. Phong, and L. Wang. Key-private proxy re-encryption under LWE. In Progress in Cryptology - INDOCRYPT 2013, pages 1--18. Springer, 2013. Google ScholarDigital Library
- G. Ateniese, K. Benson, and S. Hohenberger. Key-private proxy re-encryption. Topics in Cryptology - CT-RSA 2009, pages 279--294, 2009. Google ScholarDigital Library
- G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved proxy re-encryption schemes with applications to secure distributed storage. In Proceedings of the 12th Annual Network and Distributed System Security Symposium, pages 29--44, 2005.Google Scholar
- G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Transactions on Information and System Security (TISSEC), 9(1):1--30, 2006. Google ScholarDigital Library
- D. V. Bailey, D. Coffin, A. Elbirt, J. H. Silverman, and A. D. Woodbury. NTRU in constrained devices. In Cryptographic Hardware and Embedded Systems|CHES 2001, pages 262--272. Springer, 2001. Google ScholarDigital Library
- E. Barker, W. Barker, W. Burr, W. Polk, and M. Smid. Recommendation for key management - part 1: General. Technical report, 2005. Google ScholarDigital Library
- E. Barker, L. Chen, A. Roginsky, and M. Smid. Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography. NIST special publication 800-56A (Revision 2), NIST, May 2013.Google Scholar
- M. Blaze, G. Bleumer, and M. Strauss. Divertible protocols and atomic proxy cryptography. Advances in Cryptology|EUROCRYPT'98, pages 127--144, 1998.Google Scholar
- R. Canetti and S. Hohenberger. Chosen-ciphertext secure proxy re-encryption. In Proceedings of the 14th ACM conference on Computer and communications security, pages 185--194. ACM, 2007. Google ScholarDigital Library
- C. Chu and W. Tzeng. Identity-based proxy re-encryption without random oracles. Information Security, pages 189--202, 2007. Google ScholarDigital Library
- A. De Caro. Java Lattice Based Cryptography Library (jLBC). http://gas.dia.unisa.it/projects/jlbc/.Google Scholar
- A. De Caro and V. Iovino. jPBC: Java pairing based cryptography. In Proceedings of the 16th IEEE Symposium on Computers and Communications, ISCC 2011, pages 850--855. IEEE, 2011. Google ScholarDigital Library
- S. D. Galbraith, K. G. Paterson, and N. P. Smart. Pairings for cryptographers. Discrete Applied Mathematics, 156(16):3113--3121, 2008. Google ScholarDigital Library
- C. Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, STOC '09, pages 169--178, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- M. Green and G. Ateniese. Identity-based proxy re-encryption. In Applied Cryptography and Network Security, pages 288--306. Springer, 2007. Google ScholarDigital Library
- J. Hermans, F. Vercauteren, and B. Preneel. Speed records for ntru. In Topics in Cryptology-CT-RSA 2010, pages 73--88. Springer, 2010. Google ScholarDigital Library
- J. Hoffstein, J. Pipher, and J. H. Silverman. Ntru: A ring-based public key cryptosystem. In Algorithmic number theory, pages 267--288. Springer, 1998. Google ScholarCross Ref
- B. Libert and D. Vergnaud. Unidirectional chosen-ciphertext secure proxy re-encryption. Information Theory, IEEE Transactions on, 57(3):1786--1802, 2011. Google ScholarDigital Library
- A. López-Alt, E. Tromer, and V. Vaikuntanathan. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Proceedings of the 44th symposium on Theory of Computing, pages 1219--1234. ACM, 2012. Google ScholarDigital Library
- X. Lv, B. Yang, and C. Pei. Efficient traitor tracing scheme based on ntru. In Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on, pages 120--124. IEEE, 2005. Google ScholarDigital Library
- V. Lyubashevsky, C. Peikert, and O. Regev. On ideal lattices and learning with errors over rings. Journal of the ACM (JACM), 60(6):43, 2013. Google ScholarDigital Library
- D. Stehlé and R. Steinfeld. Making NTRU as secure as worst-case problems over ideal lattices. In Advances in Cryptology--EUROCRYPT 2011, pages 27--47. Springer, 2011. Google ScholarDigital Library
- D. Stehlé and R. Steinfeld. Making NTRUEncrypt and NTRUSign as secure as standard worst-case problems over ideal lattices. IACR Cryptology ePrint Archive, 2013:4, 2013.Google Scholar
- J. Weng, R. H. Deng, S. Liu, and K. Chen. Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings. Information Sciences, 180(24):5077--5089, 2010. Google ScholarDigital Library
- W. Whyte, N. Howgrave-Graham, J. Hoffstein, J. Pipher, J. Silverman, and P. Hirschhorn. IEEE P1363.1: Draft standard for public-key cryptographic techniques based on hard problems over lattices. Technical report, IEEE, 2008.Google Scholar
- K. Xagawa and K. Tanaka. Proxy re-encryption based on learning with errors. In Proceedings of the 2010 Symposium on Cryptography and Information Security (SCIS 2010), 2010.Google Scholar
Index Terms
- NTRUReEncrypt: An Efficient Proxy Re-Encryption Scheme Based on NTRU
Recommendations
NTWE: A Natural Combination of NTRU and LWE
Post-Quantum CryptographyAbstractLattice-based cryptosystems are some of the primary post-quantum secure alternatives to the asymmetric cryptography that is used today. These lattice-based cryptosystems typically rely on the hardness of some version of either the NTRU or the LWE ...
Lattice-based key private PREs with HRA security and PCS security
AbstractProxy re-encryption (PRE) schemes, which nicely solve the problem of delegating decryption rights, enable a semi-trusted proxy to transform a ciphertext encrypted under one key into a ciphertext of the same message under another ...
Highlights- Proxy Re-Encryption Based on Standard LWE Assumptions.
- Security Against Honest ...
A provably secure collusion-resistant identity-based proxy re-encryption scheme based on NTRU
AbstractProxy re-encryption (PRE) technology realizes the transformation of decryption right from a delegator to a delegatee. In response to the rapid development of quantum attack technology, scholars have proposed the lattice-based PRE schemes, and the ...
Comments