# BART PRENEEL PHD THESIS

It makes sense to define white-box cryptography accordingly since it reflects more reality. Similar theoretic approaches have been conceived for white-box cryptography in [Sax09]. Theory White-box cryptography is often linked with code obfuscation, since both aim to protect software implementations. A security notion is a formal description of the security of a cryptographic scheme. Both have received similar scepticism on its feasibility and lack of theoretic foundations.

A security notion is a formal description of the security of a cryptographic scheme. 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 Obfuscating Point Functions. Chand Gupta, and G. White-box implementations and cryptanalysis results A selection of the state of the art: Jan 13, version:

Both have received similar scepticism on its feasibility and lack of theoretic foundations.

# Bart Preneel | SBA Research

Attacking an obfuscated cipher by injecting faults. Positive Results and Techniques for Obfuscation.

On the Impossibility of Obfuscation with Auxiliary Input. Wyseur, and Bart Preneel: Jan 13, version: 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. Indeed, it does not suffice to only protect an application against extraction of embedded secret keys. On the Im possibility of Obfuscating Programs. Wee [Wee05] presented a provably secure obfuscator for a point function, which can be exploited in practice to construct authentication functionalities.

For example, to create preeel 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. Shafi Goldwasser and Yael Tauman Kalai. Obfuscation for Cryptographic Purposes.

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. Ran Canetti and Mayank Varia. ITCC 1pages Similar theoretic approaches have been conceived for white-box cryptography in [Sax09]. Phf research on code obfuscation gained momentum with the seminal paper of Barak et al. Resources Slides March — slides PhD defense. A security notion is a formal description of the security of a cryptographic scheme.

# White-box cryptography

Chand Gupta, and G. 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: On Obfuscating Point Functions. Theory White-box cryptography is often linked with code obfuscation, since both aim to protect software implementations. It makes sense to define white-box cryptography accordingly since it reflects more reality.