Efficient and Provable White-Box Primitives - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Efficient and Provable White-Box Primitives

Résumé

In recent years there have been several attempts to build white-box block ciphers whose implementations aim to be incompress-ible. This includes the weak white-box ASASA construction by Bouil-laguet, 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.
Fichier principal
Vignette du fichier
h4.pdf (594.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01427810 , version 1 (06-01-2017)

Identifiants

Citer

Pierre-Alain Fouque, Pierre Karpman, Paul Kirchner, Brice Minaud. Efficient and Provable White-Box Primitives. ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Dec 2016, Hanoï, Vietnam. pp.159 - 188, ⟨10.1007/978-3-662-53887-6_6⟩. ⟨hal-01427810⟩
1535 Consultations
493 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More