# BART PRENEEL THESIS

Indeed, it does not suffice to only protect an application against extraction of embedded secret keys. Wee [Wee05] presented a provably secure obfuscator for a point function, which can be exploited in practice to construct authentication functionalities. Positive Results and Techniques for Obfuscation. Wyseur, and Bart Preneel: 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. A security notion is a formal description of the security of a cryptographic scheme.

Attacking an obfuscated cipher by injecting faults. Both have received similar scepticism on its feasibility and lack of theoretic foundations. 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. Theory White-box cryptography is often linked with code obfuscation, since both aim to protect software implementations.

Shafi Goldwasser tyesis Yael Tauman Kalai. Positive Results and Techniques for Obfuscation. White-box implementations and cryptanalysis results A selection of the state of the art: 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.

Chand Gupta, and G.

It makes sense to define white-box cryptography accordingly since it reflects more reality. For rhesis, 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.

Resources Slides March — slides PhD defense. A security notion is a formal description of the security of a cryptographic scheme.

Obfuscation for Cryptographic Purposes. Wee [Wee05] presented a provably secure obfuscator for a point function, which can be exploited in practice to construct authentication functionalities.

Wyseur, and Bart Preneel: Theory White-box cryptography is often linked with code obfuscation, since both aim to protect software implementations. Research Academic research in white-box cryptography can be categorized into three activities.

Theoretic research on code obfuscation gained momentum with the seminal paper of Barak et al. On the Ppreneel of Obfuscation with Auxiliary Input. Both have received similar scepticism on its feasibility and lack of theoretic foundations.

## Whiteboxcrypto

Ran Canetti and Mayank Varia. Similar theoretic approaches have been conceived for white-box cryptography in [Sax09].

On Obfuscating Point Functions. On the Im possibility of Obfuscating Programs. Attacking an obfuscated cipher by injecting faults.

# White-box cryptography

Jan 13, version: Indeed, it does not suffice to only protect an application against extraction of embedded secret keys. ITCC 1pages The main difference between code obfuscation and white-box cryptography is that the security of the latter needs to be validated with respect to security notions.

Nevertheless, this result does not exclude the existence of secure code obfuscators: