Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Multilinear Maps from Obfuscation
verfasst von : Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction.
We provide two distinct, but closely related constructions and show that multilinear analogues of the \(\mathrm {DDH} \) assumption hold for them. Our first construction is symmetric and comes with a \(\kappa \)-linear map \(\mathbf {e}: {{{\mathbb {G}}}}^\kappa \longrightarrow {{\mathbb {G}}} _T\)for prime-order groups \({{\mathbb {G}}} \) and \({{\mathbb {G}}} _T\). To establish the hardness of the \(\kappa \)-linear \(\mathrm {DDH} \) problem, we rely on the existence of a base group for which the \((\kappa -1)\)-strong \(\mathrm {DDH} \) assumption holds. Our second construction is for the asymmetric setting, where \(\mathbf {e}: {{\mathbb {G}}} _1 \times \cdots \times {{\mathbb {G}}} _{\kappa } \longrightarrow {{\mathbb {G}}} _T\) for a collection of \(\kappa +1\) prime-order groups \({{\mathbb {G}}} _i\) and \({{\mathbb {G}}} _T\), and relies only on the standard \(\mathrm {DDH} \) assumption in its base group. In both constructions the linearity \(\kappa \) can be set to any arbitrary but a priori fixed polynomial value in the security parameter.
We rely on a number of powerful tools in our constructions: (probabilistic) indistinguishability obfuscation, dual-mode NIZK proof systems (with perfect soundness, witness indistinguishability and zero knowledge), and additively homomorphic encryption for the group \(\mathbb {Z}_N^{+}\). At a high level, we enable “bootstrapping” multilinear assumptions from their simpler counterparts in standard cryptographic groups, and show the equivalence of IO and multilinear maps under the existence of the aforementioned primitives.