In this paper we show how to engineer proofs of security for software implementations of leakage-resilient cryptosystems on execution platforms with concurrency and caches. The proofs we derive are based on binary executables of the cryptosystem and on simple but realistic models of microprocessors.

We present the first chosen-ciphertext secure public-key encryption schemes resilient to continuous tampering of arbitrary (efficiently computable) functions. Since it is impossible to realize such a scheme without a self-destruction or key-updating mechanism, our proposals allow for either of them. As in the previous works resilient to this type of tampering attacks, our schemes also tolerate ...

In this paper, we initiate the study of leakage-resilient tweakable encryption schemes in the relative key-leakage model, where the adversary can obtain (arbitrary) partial information about the secret key. We also focus on the minimal and generic assumptions needed to construct such a primitive. Interestingly, we show provably secure constructions of leakage-resilient (LR) tweakable encryption...

We extend the techniques of Kiltz et al. (in ASIACRYPT 2010) and Galindo et al. (in SAC 2012) to construct two efficient leakage-resilient signature schemes. Our schemes based on Boneh-LynnShacham (BLS) short signature and Waters signature schemes, respectively. Both of them are more efficient than Galindo et al.’s scheme, and can tolerate leakage of (1− o(1))/2 of the secret key at every signa...

Due to the popularity of mobile communication, many computing devices are exposed remote environments without physical protection so that these easily suffer from leakage attacks (e.g., side-channel attacks). Under such attacks, when a device performs some cryptographic algorithm, an adversary may acquire partial bits secret keys participated in this algorithm. To resist researchers offer leaka...

Recently it was conjectured that an ElGamal-based public-key encryption scheme with stateful decryption resists lunch-time chosen ciphertext and leakage attacks in the only computation leaks information model. We give a non-trivial upper bound on the amount of leakage tolerated by this conjecture. More precisely, we prove that the conjecture does not hold if more than a ( 3 8 + o (1) ) fraction...

Side-channel attacks represent a very frequent and severe type of attack against implementations of cryptographic protocols. Most countermeasures proposed until recently are ad-hoc, offer only partial remedy and fail to capture the problem in its entirety. In light of this, the last few years the cryptographic community has tried to set the theoretical foundations in order to formally address t...

We devise the first identity-based encryption (IBE) that remains secure even when the adversary is equipped with auxiliary input (STOC ’09) – any computationally uninvertible function of the master secret key and the identity-based secret key. In particular, this is more general than the tolerance of Chow et al.’s IBE schemes (CCS ’10) and Lewko et al.’s IBE schemes (TCC ’11), in which the leak...