White-box implementations and cryptanalysis results A selection of the state of the art: On the Impossibility of Obfuscation with Auxiliary Input. Wyseur, and Bart Preneel: 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 its embedded key, but it must also be hard to invert. Attacking an obfuscated cipher by injecting faults.

Nevertheless, this result does not exclude the existence of secure code obfuscators: Resources Slides March — slides PhD defense. White-box implementations and cryptanalysis results A selection of the state of the art: Both have received similar scepticism on its feasibility and lack of theoretic foundations. Obfuscation for Cryptographic Purposes. On Obfuscating Point Functions.

On the Im possibility of Obfuscating Programs.

White-box cryptography

Shafi Goldwasser and Yael Tauman Kalai. Wyseur, and Bart Preneel: Theoretic research on code obfuscation gained momentum with the seminal paper of Barak et al. Ran Canetti and Mayank Varia. It makes sense to define white-box cryptography accordingly since it reflects more reality.

  MIDDLESEX EUGENIDES THESIS

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. Chand Gupta, and G. The main difference between code obfuscation and thessis cryptography is that the security of the latter needs to be validated with respect to security notions.

Indeed, it does not suffice to only protect an application against extraction of embedded secret keys.

Bart Preneel

A security notion is a formal description of the security of a cryptographic scheme. Nevertheless, this result does not exclude the existence of secure code obfuscators: Attacking an obfuscated cipher by injecting faults.

For gart, 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 its embedded key, but it must also be hard to invert.

Both have received similar scepticism on its feasibility and lack of theoretic foundations. Obfuscation for Cryptographic Purposes.

  BRUNEL COURSEWORK SUBMISSION

bart preneel phd thesis

Similar theoretic approaches have been conceived for white-box cryptography in [Sax09]. On the Impossibility of Obfuscation with Auxiliary Input. On Obfuscating Point Functions.

bart preneel phd thesis

Positive Results and Techniques for Obfuscation. Theory White-box cryptography is often linked with code obfuscation, since both aim to protect software implementations. ITCC 1pages Jan 13, version: Resources Slides March — slides PhD defense.

White-box implementations and cryptanalysis results A selection of the state of the art: Research Academic research in white-box cryptography can be categorized into three activities. Wee [Wee05] presented a provably secure obfuscator for a point function, which can be exploited in practice to construct authentication functionalities.