Cryptography with Tamperable and Leaky Memory
Explore cryptographic systems' security against physical attacks in this conference talk from Crypto 2011. Delve into a model where all memory is assumed to be both leaky and tamperable, with these vulnerabilities occurring repeatedly and continually. Learn about the construction of a signature scheme and an encryption scheme that are provably secure against such attacks, relying on the linear assumption over bilinear groups. Discover how these schemes improve upon previous results in the continual leakage regime, tolerating higher leakage rates between key updates. Examine the separate consideration of a model allowing only continual and repeated tampering with bounded leakage, and understand the positive results achieved through the possibility of "self-destruct" without memory updates.