Graded Encoding Schemes from Obfuscation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Graded Encoding Schemes from Obfuscation


We construct a graded encoding scheme (GES), an approximate form of graded multilinear maps. Our construction relies on indistinguishability obfuscation, and a pairing-friendly group in which (a suitable variant of) the strong Diffie-Hellman assumption holds. As a result of this abstract approach, our GES has a number of advantages over previous constructions. Most importantly: • We can prove that the multilinear decisional Diffie-Hellman (MDDH) assumption holds in our setting, assuming the used ingredients are secure (in a well-defined and standard sense). Hence, our GES does not succumb to so-called "zeroizing" attacks if the underlying ingredients are secure. • Encodings in our GES do not carry any noise. Thus, unlike previous GES constructions, there is no upper bound on the number of operations one can perform with our encodings. Hence, our GES essentially realizes what Garg et al. (EUROCRYPT 2013) call the "dream version" of a GES. Technically, our scheme extends a previous, non-graded approximate multilinear map scheme due to Albrecht et al. (TCC 2016-A). To introduce a graded structure, we develop a new view of encodings at different levels as polynomials of different degrees.
Fichier principal
Vignette du fichier
011.pdf (619.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01904151 , version 1 (24-10-2018)



Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia. Graded Encoding Schemes from Obfuscation. PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Mar 2018, Rio De Janeiro, Brazil. ⟨10.1007/978-3-319-76581-5_13⟩. ⟨hal-01904151⟩
59 View
169 Download



Gmail Facebook Twitter LinkedIn More