White-box cryptography aims at providing security against an adversary that has access to the encryption process. Numerous whitebox encryption schemes were proposed since the introduction of whitebox cryptography by Chow et al. in 2002. However, most of them are slow, and thus, can be used in practice only to protect very small amounts of information, such as encryption keys. In this extended abstract we present a new threat model for whitebox cryptography which corresponds to the practical abilities of the adversary in a wide range of applications. Furthermore, we study design criteria for white-box primitives that are important from the industry point of view. Finally, we propose a class of new primitives that combine a white-box algorithm with a standard block cipher to obtain white-box protection for encrypting long messages, with high security and reasonable performance.
|Title of host publication||Cryptology and Network Security - 15th International Conference, CANS 2016, Proceedings|
|Editors||Giuseppe Persiano, Sara Foresti|
|Number of pages||6|
|State||Published - 2016|
|Event||15th International Conference on Cryptology and Network Security, CANS 2016 - Milan, Italy|
Duration: 14 Nov 2016 → 16 Nov 2016
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||15th International Conference on Cryptology and Network Security, CANS 2016|
|Period||14/11/16 → 16/11/16|
Bibliographical notePublisher Copyright:
© Springer International Publishing AG 2016.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)