White-Box Cryptography Revisited

Bogdanov, Andrey; Isobe, Takanori

doi:10.1145/2810103.2813699

Cited by 67 publications

(110 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Weak incompressibility is very close to incompressibility definitions in previous work [BBK14,BI15], and can be regarded as a formalization of the space-hardness definition of [BI15]. Strong incompressibility on the other hand is a very demanding notion; in particular it is strictly stronger than the incompressibility definition of [DLPR13].…”

Section: Our Contributionmentioning

confidence: 72%

“…This notion has been called incompressibility in [DLPR13], weak white-box in [BBK14] and space-hardness in [BI15] 2 . This definition implies in particular that it is difficult for an adversary to extract a short master key, which captures the goal of the original white-box constructions by Chow et al In addition, the intent behind this approach is that large, incompressible code can more easily be made resistant to code lifting when combined with engineering obfuscation techniques [BBK14,BI15,Gil16]; and make code distribution more cumbersome for a potential attacker.…”

Section: White-box Cryptographymentioning

confidence: 99%

“…A fortiori there is no known way to achieve incompressibility for AES, DES or indeed any pre-existing cipher. However recent constructions have proposed new, ad-hoc, and quite efficient ciphers specifically designed to meet the incompressibility criterion [BBK14,BI15]. These constructions aim for incompressibility by relying on a large pseudo-random table hard-coded into the implementation of the cipher, with repeated calls to the table being made during the course of encryption.…”

Section: White-box Cryptographymentioning

confidence: 99%

“…Unfortunately this construction was broken [DDKL15,MDFK15]. This type of attack is completely avoided in the new SPACE construction [BI15], where the table is built by truncating calls to AES. This makes it impossible for an adversary to recover the secret key used to generate the table, based solely on the security of AES.…”

Section: White-box Cryptographymentioning

confidence: 99%

“…Both of the previously mentioned constructions in [BBK14,BI15] use ad-hoc designs. They are quite efficient, but cannot hope to achieve provable security.…”

Section: Our Contributionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient and Provable White-Box Primitives

Fouque

Karpman

Kirchner

et al. 2016

Advances in Cryptology – ASIACRYPT 2016

View full text Add to dashboard Cite

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

show abstract

Section: Our Contributionmentioning

confidence: 72%

Section: White-box Cryptographymentioning

confidence: 99%

Section: White-box Cryptographymentioning

confidence: 99%

Section: White-box Cryptographymentioning

confidence: 99%

“…Both of the previously mentioned constructions in [BBK14,BI15] use ad-hoc designs. They are quite efficient, but cannot hope to achieve provable security.…”

Section: Our Contributionmentioning

confidence: 99%

See 3 more Smart Citations