Leakage resilient codes (LRCs) are probabilistic encoding schemes that guarantee message hiding even under some bounded leakage on the codeword. We introduce the notion of fully leakage resilient codes (FLRCs), where the adversary can leak some \lambda_0 bits from the encoding process, i.e., the message and the randomness involved during the encoding process. In addition the adversary can as usual leak from the codeword.
In this talk I will provide an informal overview showing afairly general impossibility result for FLRCs in the popular split-state model, where the codeword is broken into independent parts and where the leakage occurs independently on the parts. In the paper we give two feasibility results for weaker models. First, we show that for \NC^0-bounded leakage from the randomness and arbitrary poly-time leakage from the parts of the codeword the
inner-product construction proposed by Dav铆 \etal (SCN'10) and successively improved by Dziembowski and Faust (ASIACRYPT'11) is a FLRC for the split-state model. Second, we provide a compiler from any LRC to a FLRC in the common reference string model for any fixed leakage family of small cardinality. I will give a brief overview of the intuitions underling of these two results.
This is a joint work with Jesper Buus Nielsen.
Antonio Faonio holds a postdoctoral position at Aarhus University hosted by Jesper Buus Nielsen, he got a PhD at Sapienza University of Rome, under the guidance of Giuseppe Ateniese. His research interests are leakage and tamper resilient cryptography, subversion resilient cryptography and, more in general, theory of cryptography.