Most security games in cryptography assume the adversary has only black-box access to the primitives. This leads to constructions that are secure in theory when the adversary is restricted to such access, but potentially vulnerable to side-channel attacks when implemented in practice. Leakage-resilient circuits are circuit compilers that produce circuits that remain secure even when some 'side-channel' information about the internal computation is leaked. In this talk, we will see the constructions of LRCs against leakage functions in NC1, from the paper
Leakage-Resilient Circuits against NC1, Revisited by Yuyu Wang.
