Cryptology ePrint Archive: Report 2018/1129

On Kilian's Randomization of Multilinear Map Encodings

Jean-Sebastien Coron and Hilder V. L. Pereira

Abstract: Indistinguishability obfuscation constructions based on matrix branching programs generally proceed in two steps: first apply Kilian's randomization of the matrix product computation, and then encode the matrices using a multilinear map scheme. In this paper we observe that by applying Kilian's randomization after encoding, the complexity of the best attacks is significantly increased for CLT13. This implies that much smaller parameters can be used, which improves the efficiency of the constructions by several orders of magnitude.

As an application, we describe the first concrete implementation of non-interactive Diffie-Hellman key exchange secure against existing attacks. Key exchange was originally the most straightforward application of multilinear maps; however it was quickly broken for the three known families of multilinear maps (GGH13, CLT13 and GGH15). Here we describe the first implementation of key exchange based on CLT13 that is resistant against the Cheon et al. attack. For N=4 users and a medium (62 bits) level of security, our implementation requires 8 GB of public parameters, and a few minutes for the derivation of a shared key. Without Kilian's randomization of encodings our construction would be completely unpractical, as it would require more than 100 TB of public parameters.

Category / Keywords: public-key cryptography / Multilinear maps, key-exchange, Approximate-GCD problem, GCD attacks, lattice attacks

Date: received 20 Nov 2018

Contact author: jscoron at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20181129:023012 (All versions of this report)

Short URL: ia.cr/2018/1129


[ Cryptology ePrint archive ]