Completed
How many table accesses are necessary?
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Efficient and Provable White Box Primitives
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Motivation incompressibility
- 3 White-box encryption schemes
- 4 Black and white adversaries
- 5 White-box security
- 6 Global strategy
- 7 Getting rid of the easy adversaries
- 8 A model for (weak) incompressibility
- 9 Remarks on ENC-TCOM
- 10 The Coureur DesBois family
- 11 How many table accesses are necessary?
- 12 Features of CDB and PC
- 13 Selected implementation figures: PC
- 14 (Lack of) comparison with SPACE & SPNbox
