A Simple Provably Secure AKE from the LWE Problem

Abstract EN

We first propose an authenticated key exchange (AKE) from the LWE problem.

The AKE is simple since it does not involve any other cryptographic primitives to achieve authentication and depends on solely the LWE problem in the worst-case (e.g., SVP and SIVP).

We give its security under the BR model, which captures wPFS and might be appealing in specific applications.