In recent years there have been several attempts to build white-box block ciphers whose implementations aim 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 from CCS 2015. 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.
Fouque et al. REF proposed white-box primitives offering provable security guarantees and concrete instantiations for their construction with low overhead.
Efficient and Provable White-Box Primitives
IACR Cryptology ePrint Archive
IACR Cryptology ePrint Archive
Computer Science