Leakage-Resilient Cryptography from Minimal Assumptions

Date Added: Oct 2012
Format: PDF

A central goal in cryptography is to base cryptosystems on intractability assumptions that are as weak and as general as possible; that way, if one problem turns out to be susceptible to a new attack or if another turns out to yield better performance, the authors may readily replace the underlying problem in their cryptosystem. Another goal is to design cryptosystems in strong security models that account for a wide range of possible attacks. Their work lies at the intersection of these two areas, by studying leakage-resilient security under general and minimal assumptions.