A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem

By Jintai Ding. IACR Cryptology ePrint Archive, 2012

304 citations recorded by the source corpus.

How researchers see this paper

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

A Modular Analysis of the Fujisaki-Okamoto Transformation (2017, background): “Dealing with imperfectly correct schemes is of great importance since many (but not all) practical lattice-based encryption schemes have a small correctness error, see, e.g., DXL [21], Peikert [34], BCNS [14], New Hope [3], Frodo [13], Lizard [17], and Kyber [12].”
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017, background): “The advantage of the constructions in [35, 60] is that if one would like to construct a CPA-secure KEM transmitting a b-bit key, then the ciphertext is b bits shorter, which is about a 3% savings for typical parameters.”
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].”