White-Box Security Notions for Symmetric Encryption Schemes [chapter]

Cécile Delerablée, Tancrède Lepoint, Pascal Paillier, Matthieu Rivain
2014 Lecture Notes in Computer Science  
White-box cryptography has attracted a growing interest from researchers in the last decade. Several white-box implementations of standard block-ciphers (DES, AES) have been proposed but they have all been broken. On the other hand, neither evidence of existence nor proofs of impossibility have been provided for this particular setting. This might be in part because it is still quite unclear what white-box cryptography really aims to achieve and which security properties are expected from
more » ... box programs in applications. This paper builds a first step towards a practical answer to this question by translating folklore intuitions behind white-box cryptography into concrete security notions. Specifically, we introduce the notion of white-box compiler that turns a symmetric encryption scheme into randomized white-box programs, and we capture several desired security properties such as onewayness, incompressibility and traceability for white-box programs. We also give concrete examples of white-box compilers that already achieve some of these notions. Overall, our results open new perspectives on the design of white-box programs that securely implement symmetric encryption.
doi:10.1007/978-3-662-43414-7_13 fatcat:rv6w5ogxabetln6tt3rlrzopwm