Security Notions for Whitebox Cryptography

Add to your list(s) Download to your calendar using vCal

• Chris Brzuska (Hamburg University of Technology)
• Thursday 19 January 2017, 11:00-12:00
• Sloman Lounge, School of Computer Science.

If you have a question about this talk, please contact Andreea Radu.

Whitebox versions of the AES encryption and decryption algorithm (shall) allow to run encryption/decryption algorithms such as AES “securely” in untrusted environments, e.g., a smartphone without secure element. The main goal of this seminar is to discuss security notions in the context of whitebox cryptography.

The baseline security property of whitebox encryption/decryption schemes historically is that one shouldn’t be able to extract the key. While this property is necessary to achieve meaningful security, it is by no means sufficient.

But what is meaningful security of whitebox encryption/decryption? After all, if I have a program for encryption/decryption, then I can always lift the code to another device. We discuss several approaches to prevent/detect code-lifting: Incompressability, platform-binding, application-binding and traceability. We also discuss the limits of software-only solutions suggesting that a middle-ground between “software-only” and “hardware-only” might be the way to go.

This is ongoig work with Estuardo Alpirez Bock, Alessandro Amadori, Joppe Bos and Wil Michiels

This talk is part of the Computer Security Seminars series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Security Seminars
• Sloman Lounge, School of Computer Science
• computer sience

Note that ex-directory lists are not shown.