Efficient and Provable White-Box Primitives

Pierre-Alain Fouque, Pierre Karpman, Paul Kirchner, Brice Minaud

Research output: Chapter in Book/Report/Conference proceedingConference contribution

92 Downloads (Pure)


In recent years there have been several attempts to build white-box block ciphers whose implementation aims to be incompressible. This includes the weak white-box ASASA construction by Bouillaguet, Biryukov and Khovratovich from Asiacrypt 2014, and the recent space-hard construction by Bogdanov and Isobe at CCS 2016. In this article we propose the first constructions aiming at the same goal while offering provable security guarantees. Moreover we propose concrete instantiations of our constructions, which prove to be quite efficient and competitive with prior work. Thus provable security comes with a surprisingly low overhead.
Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2016
Subtitle of host publication22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I
PublisherSpringer Verlag
Number of pages30
ISBN (Electronic)978-3-662-53887-6
ISBN (Print)978-3-662-53886-9
Publication statusE-pub ahead of print - 9 Nov 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743


  • White-Box Cryptography
  • Provable Security

Cite this