Paper 2016/642
Efficient and Provable White-Box Primitives
Abstract
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.
Note: This update fixes a mistake in the original version of the article, related to the conversion of WhiteKey from a key generator into an encryption scheme. The original conversion used a PRG, the new one uses a random oracle. The mistake and its correction are explained in Appendix D.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- A minor revision of an IACR publication in ASIACRYPT 2016
- Keywords
- White-Box CryptographyProvable Security
- Contact author(s)
- brice minaud @ gmail com
- History
- 2023-01-23: revised
- 2016-06-21: received
- See all versions
- Short URL
- https://ia.cr/2016/642
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/642,
author = {Pierre-Alain Fouque and Pierre Karpman and Paul Kirchner and Brice Minaud},
title = {Efficient and Provable White-Box Primitives},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/642},
year = {2016},
url = {https://eprint.iacr.org/2016/642}
}
