Sciweavers

Share
ICS
2010
Tsinghua U.

Robustness of the Learning with Errors Assumption

9 years 5 months ago
Robustness of the Learning with Errors Assumption
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are secure against large classes of side-channel attacks. Recently, many works have focused on designing various cryptographic primitives that are robust (retain security) even when the secret key is "leaky", under various intractability assumptions. In this work we propose to take a step back and ask a more basic question: which of our cryptographic assumptions (rather than cryptographic schemes) are robust in presence of leakage of their underlying secrets? Our main result is that the hardness of the learning with error (LWE) problem implies its hardness with leaky secrets. More generally, we show that the standard LWE assumption implies that LWE is secure even if the secret is taken from an arbitrary distribution with sufficient entropy, and even in the presence of hard-to-invert auxiliary inputs. We ...
Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod
Added 02 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where ICS
Authors Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod Vaikuntanathan
Comments (0)
books