ITCC 1 , pages Theoretic research on code obfuscation gained momentum with the seminal paper of Barak et al. On Obfuscating Point Functions. On the Impossibility of Obfuscation with Auxiliary Input. On the Im possibility of Obfuscating Programs.
Shafi Goldwasser and Yael Tauman Kalai. Wyseur, and Bart Preneel: Similar theoretic approaches have been conceived for white-box cryptography in [Sax09]. Obfuscation for Cryptographic Purposes. Chand Gupta, and G. On Obfuscating Point Functions.
On the Im possibility of Obfuscating Programs. The main difference between code obfuscation and white-box cryptography is that the security of the latter needs preheel be validated with respect to security notions.
A security notion is a formal description of the security of a cryptographic scheme. Wee [Wee05] presented a provably secure obfuscator for a point function, which can be exploited in practice to construct authentication functionalities.
Bart Preneel | SBA Research
Research Academic research in white-box cryptography can be categorized into three activities. Indeed, it does not suffice to only protect an application against extraction of embedded secret keys.
Both have received similar scepticism on its feasibility and lack of theoretic foundations. Resources Slides March — slides PhD defense.
On Obfuscating Point Functions. Chand Gupta, and G. Theory White-box cryptography is often linked with code obfuscation, since both aim to protect software implementations.
Similar theoretic approaches have been conceived for white-box cryptography in [Sax09]. For example, to create the equivalent of a smart-card-based AES encryption function in software, it does not suffice that the white-box implementation resists extraction of barrt embedded key, but it must also be hard to invert.
Wyseur, and Bart Preneel: White-box implementations and cryptanalysis results A selection of thesls state of the art: Obfuscation for Cryptographic Purposes. Nevertheless, this result does not exclude the existence of secure code obfuscators: For example, a scheme is defined CPA-secure if an attacker cannot compute the plaintext from a given ciphertext, or KR-secure when the secret key cannot be recovered.
On the Impossibility of Obfuscation with Auxiliary Input. Attacking an obfuscated cipher by injecting faults.
ITCC 1pages Ran Canetti and Mayank Varia. Positive Results and Techniques for Obfuscation.
Theoretic research on code obfuscation gained momentum with the seminal paper of Barak et al. It makes sense to define white-box cryptography accordingly since it reflects more reality. Jan 13, version: Shafi Goldwasser and Yael Tauman Kalai.