Research
Academic research in whitebox cryptography can be categorized into three activities.
Constructions & Cryptanalysis
Theory
In Practice
An indepth overview can be found in my PhD dissertation, which is a snapshot of the state of the art as it was in 2009, or in some other overview papers listed here:
 Brecht Wyseur, "WhiteBox Cryptography", PhD thesis, Katholieke Universiteit Leuven, B. Preneel (promotor), 169+32 pages, March 2009. [Dissertation ] [PhD defense presentation ]
 Brecht Wyseur, "whitebox cryptography: hiding keys in software", MISC magazine, April 2012.
Whitebox implementations and cryptanalysis results
A selection of the state of the art:
References
 WhiteBox DES
 S. Chow, P. Eisen, H. Johnson, P.C. van Oorschot. A Whitebox DES Implementation for DRM Applications. In Proceedings of 2nd ACM Workshop on Digital Rights Management (DRM 2002), volume 2696 of Lecture Notes in Computer Science, pages 115. Jan 13, 2003 version: ps.
 Matthias Jacob, Dan Boneh, and Edward Felten. Attacking an obfuscated cipher by injecting faults. In Proceedings of 2nd ACM Workshop on Digital Rights Management (DRM 2002), volume 2696 of Lecture Notes in Computer Science.
 Hamilton E. Link, William D. Neumann. Clarifying Obfuscation: Improving the Security of WhiteBox DES. ITCC (1) 2005, pages 679684.
 B. Wyseur, and Bart Preneel: Condensed WhiteBox Implementations In Proceedings of the 26th Symposium of Information Theory in the Benelux, 2005
 Louis Goubin, JeanMichel Masereel, and Michael Quisquater. Cryptanalysis of WhiteBox DES Implementations. Cryptology ePrint Archive, Report 2007/035, 2007. http://www.eprint.iacr.org/.
 Brecht Wyseur, Wil Michiels, Paul Gorissen, and Bart Preneel. Cryptanalysis of WhiteBox DES Implementations with Arbitrary External Encodings. Cryptology ePrint Archive, Report 2007/104, 2007. http://www.eprint.iacr.org/.
 WhiteBox AES
 S. Chow, P. Eisen, H. Johnson, P.C. van Oorschot. WhiteBox Cryptography and an AES Implementation. In 9th Annual Workshop on Selected Areas in Cryptography (SAC 2002), Aug.1516 2002, St. John's, Canada. Proceedings (revised papers): pp.250270, Springer LNCS 2595 (2003). Sept.30 2002 version: ps. Earlier version (preproceedings): ps.
 Olivier Billet, Henri Gilbert, Charaf EchChatbi. Cryptanalysis of a White Box AES Implementation. In Selected Areas in Cryptography 2004 (SAC 2004), pages 227240.
 Julien Bringer, Herve Chabanne, and Emmanuelle Dottax. White Box Cryptography: A New Attempt, Cryptology ePrint Archive, Report 2006/468, 2006
 Yoni De Mulder, Brecht Wyseur, and Bart Preneel, Cryptanalysis of a Perturbated Whitebox AES Implementation, In Progress in Cryptology  INDOCRYPT 2010, Lecture Notes in Computer Science 6498, K. Chand Gupta, and G. Gong (eds.), SpringerVerlag, pp. 292310, 2010.
 Y. De Mulder, P. Roelse, and B. Preneel, Cryptanalysis of the Xiao  Lai WhiteBox AES Implementation, In Selected Areas in Cryptography, 19th Annual International Workshop, SAC 2012, Lecture Notes in Computer Science, SpringerVerlag, 16 pages, 2012.
Theory
Whitebox cryptography is often linked with code obfuscation, since both aim to protect software implementations. Both have received similar scepticism on its feasibility and lack of theoretic foundations. Theoretic research on code obfuscation gained momentum with the seminal paper of Barak et al. Barak01] who showed that it is impossible to construct a generic obfuscator – i.e. an obfuscator that can protect any given program. Barak et al. constructed a family of functions that cannot be obfuscated; exploiting the fact
that software can always be copied preserving its functionality. Nevertheless, this result does not exclude the existence of secure code obfuscators: Wee [Wee05] presented a provably secure obfuscator for a point function, which can be exploited in practice to construct authentication functionalities.
Similar theoretic approaches have been conceived for whitebox cryptography in [Sax09]. The main difference between code obfuscation and whitebox cryptography is that the security of the latter needs to be validated with respect to security notions. A security notion is a formal description of the security of a cryptographic scheme. For example, a scheme is defined CPAsecure if an attacker cannot compute the plaintext from a given ciphertext, or KRsecure when the secret key cannot be recovered.
It makes sense to define whitebox cryptography accordingly since it reflects more reality. Indeed, it does not suffice to only protect an application against extraction of embedded secret keys. For example, to create the equivalent of a smartcardbased AES encryption function in software, it does not suffice that the whitebox implementation resists extraction of its embedded key, but it must also be hard to invert. In [Sax09], Saxena and Wyseur have shown that some security notions can never be satisfied in software (INDCCA2), and they have presented a provably secure construction with respect to the INDCPA security notion.
References
 B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (Im)possibility of Obfuscating Programs. In Advances in Cryptology  CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 118. SpringerVerlag, 2001.
 B. Lynn, M. Prabhakaran, and A. Sahai. Positive Results and Techniques for Obfuscation. In Advances in Cryptology  EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 2039. SpringerVerlag, 2004.
 Hoeteck Wee. On Obfuscating Point Functions. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC 2005), pages 523532.
 Shafi Goldwasser and Yael Tauman Kalai. On the Impossibility of Obfuscation with Auxiliary Input. In Proceedings of the 46th Symposium on Foundations of Computer Science (FOCS 2005), IEEE Computer Society, pages 553562.
 Dennis Hofheinz, John MaloneLee, and Martijn Stam. Obfuscation for Cryptographic Purposes. In Proceedings of 4th Theory of Cryptography Conference (TCC 2007), volume 4392 of Lecture Notes in Computer Science, pages 214232. SpringerVerlag, 2007.
 Susan Hohenberger, Guy Rothblum, Abhi Shelat, and Vinod Vaikuntanathan. Securely Obfuscating ReEncryption. In Proceedings of 4th Theory of Cryptography Conference (TCC 2007), volume 4392 of Lecture Notes in Computer Science, pages 233252. SpringerVerlag, 2007.
 A. Saxena, B. Wyseur, and B. Preneel, Towards Security Notions for WhiteBox Cryptography, In Information Security  12th International Conference, ISC 2009, Lecture Notes in Computer Science 5735, C. A. Ardagna, F. Martinelli, P. Samarati, and M. Yung (eds.), SpringerVerlag, 10 pages, 2009.
 Ran Canetti and Mayank Varia. NonMalleable Obfuscation. In Proceedings of 6th Theory of Cryptography Conference (TCC 2009), volume 5444 of Lecture Notes in Computer Science, pages 7390. Springer, 2009.
Resources
Slides
 March 2009  slides PhD defense
