Efficient and Provable White-Box Primitives

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

doi:10.1007/978-3-662-53887-6_6

Efficient and Provable White-Box Primitives

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

Department of Information Security

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

78 Downloads (Pure)

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.

Original language	English
Title of host publication	Advances in Cryptology – ASIACRYPT 2016
Subtitle of host publication	22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I
Publisher	Springer Verlag
Pages	159-188
Number of pages	30
ISBN (Electronic)	978-3-662-53887-6
ISBN (Print)	978-3-662-53886-9
DOIs	https://doi.org/10.1007/978-3-662-53887-6_6
Publication status	E-pub ahead of print - 9 Nov 2016

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	10031
ISSN (Print)	0302-9743

Keywords

White-Box Cryptography
Provable Security

Access to Document

10.1007/978-3-662-53887-6_6

Accepted ManuscriptAccepted author manuscript, 596 KB

https://eprint.iacr.org/2016/642

Multilinear Maps in Cryptography
Paterson, K.
Eng & Phys Sci Res Council EPSRC
31/01/14 → 30/01/17
Project: Research

Cite this

Fouque, P.-A., Karpman, P., Kirchner, P., & Minaud, B. (2016). Efficient and Provable White-Box Primitives. In Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I (pp. 159-188). (Lecture Notes in Computer Science; Vol. 10031). Springer Verlag. Advance online publication. https://doi.org/10.1007/978-3-662-53887-6_6

Fouque, Pierre-Alain ; Karpman, Pierre ; Kirchner, Paul et al. / Efficient and Provable White-Box Primitives. Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I. Springer Verlag, 2016. pp. 159-188 (Lecture Notes in Computer Science).

@inproceedings{e9f383b637ea46108bdee204864b00cd,

title = "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.",

keywords = "White-Box Cryptography, Provable Security",

author = "Pierre-Alain Fouque and Pierre Karpman and Paul Kirchner and Brice Minaud",

year = "2016",

month = nov,

day = "9",

doi = "10.1007/978-3-662-53887-6_6",

language = "English",

isbn = "978-3-662-53886-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "159--188",

booktitle = "Advances in Cryptology – ASIACRYPT 2016",

address = "Germany",

}

Fouque, P-A, Karpman, P, Kirchner, P & Minaud, B 2016, Efficient and Provable White-Box Primitives. in Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10031, Springer Verlag, pp. 159-188. https://doi.org/10.1007/978-3-662-53887-6_6

Efficient and Provable White-Box Primitives. / Fouque, Pierre-Alain; Karpman, Pierre; Kirchner, Paul et al.
Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I. Springer Verlag, 2016. p. 159-188 (Lecture Notes in Computer Science; Vol. 10031).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Efficient and Provable White-Box Primitives

AU - Fouque, Pierre-Alain

AU - Karpman, Pierre

AU - Kirchner, Paul

AU - Minaud, Brice

PY - 2016/11/9

Y1 - 2016/11/9

N2 - 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.

AB - 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.

KW - White-Box Cryptography

KW - Provable Security

U2 - 10.1007/978-3-662-53887-6_6

DO - 10.1007/978-3-662-53887-6_6

M3 - Conference contribution

SN - 978-3-662-53886-9

T3 - Lecture Notes in Computer Science

SP - 159

EP - 188

BT - Advances in Cryptology – ASIACRYPT 2016

PB - Springer Verlag

ER -

Fouque PA, Karpman P, Kirchner P, Minaud B. Efficient and Provable White-Box Primitives. In Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I. Springer Verlag. 2016. p. 159-188. (Lecture Notes in Computer Science). Epub 2016 Nov 9. doi: 10.1007/978-3-662-53887-6_6

Efficient and Provable White-Box Primitives

Abstract

Publication series

Keywords

Access to Document

Projects

Multilinear Maps in Cryptography

Cite this