Efficient and Provable White Box Primitives

Explore a talk from Asiacrypt 2016 on efficient and provable white box primitives, presented by Pierre-Alain Fouque, Pierre Karpman, Paul Kirchner, and Brice Minaud. Delve into the motivation behind incompressibility and white-box encryption schemes, examining black and white adversaries and white-box security. Understand the global strategy for addressing easy adversaries and learn about a model for weak incompressibility. Investigate the Coureur DesBois family and analyze the necessary number of table accesses. Discover the features of CDB and PC, and review selected implementation figures for PC. Conclude with a discussion on the lack of comparison with SPACE and SPNbox.