Daniel Masny

On the Hardness of Learning with Rounding over Small Modulus.

2015

We show the following reductions from the learning with errors problem (LWE) to the learning with rounding problem (LWR): (1) Learning the secret and (2) distinguishing samples from random strings is at least as hard …

Towards Sound Fresh Re-Keying with Hard (Physical) Learning Problems.

2016 · IACR Cryptology ePrint Archive

Most leakage-resilient cryptographic constructions aim at limiting the information adversaries can obtain about secret keys. In the case of asymmetric algorithms, this is usually obtained by secret sharing aka masking the key, which is made …