Paper 2016/642

Efficient and Provable White-Box Primitives

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

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.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
White-Box CryptographyProvable Security
Contact author(s)
brice minaud @ gmail com
History
2016-06-21: received
Short URL
https://ia.cr/2016/642
License
Creative Commons Attribution
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},
      note = {\url{https://eprint.iacr.org/2016/642}},
      url = {https://eprint.iacr.org/2016/642}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.