Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

By Damien Stehlé, Ron Steinfeld. International Conference on the Theory and Application of Cryptographic Techniques, 2011

468 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/0d1e97a3c371de12cad98d98eb56d658586e45b9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Information Systems

Citations in the corpus

Lattice Signatures Without Trapdoors (2012, methodology): “On the encryption front, lattice-based schemes have been making a lot of progress with recent provably-secure schemes [39, 28, 24, 41] being almost as practical as (and actually looking quite similar to) the deployed NTRU [20] encryption scheme, which in turn has many advantages over number theory-b”
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016, background): “R-LWE-based schemes have been proposed for public-key encryption [35, 24, 28], digital signatures [22, 12], and key exchange [11, 28, 36, 6, 2].”
Accelerating LTV Based Homomorphic Encryption in Reconfigurable Hardware (2015, methodology): “The LTV scheme is based on a variant of NTRU introduced earlier by Stehlé and Steinfeld [34].”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “As of writing, the most promising lattice-based cryptosystems are based on polynomial algebra [118], [120], [121]”
Bandwidth Efficient PIR from NTRU (2014, methodology): “Stehlé and Steinfeld [12] formalized the security setting and reduced the security of their NTRU variant to the ring learning with error (RLWE) problem.”
A Survey on Homomorphic Encryption Schemes (2017, methodology): “The new scheme is based on [Stehlé and Steinfeld 2011] and it uses a Flattening noise management technique adopted from the ﬂattening technique of [Gentry et al. 2013].”
Private genome analysis through homomorphic encryption (2015, methodology): “A practical SHE scheme, YASHE, was proposed in [19] based on combining ideas from [22,25,26].”
A Custom Accelerator for Homomorphic Encryption Applications (2017, methodology): “The LTV scheme is based on a variant of NTRU introduced earlier by Stehl e and Steinfeld [32].”
A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem (2012, methodology): “We use two examples, one is the RLWE-based scheme from Lyubashevsky et al. [21], and the other one is the NTRU variant from Stehlé and Steinfeld [27].”
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme (2013, methodology): “We have proposed a new fully homomorphic encryption scheme based on the scheme by Stehlé and Steinfeld which removes the non-standard decisional small polynomial ratio assumption needed in the homomorphic encryption scheme by López-Alt, Tromer and Vaikuntanathan.”
CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy (2016, unknown): “The solution of Xie et al. (2014) was to approximate these functions with low-degree polynomials, but we take a different approach here.”