Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
verfasst von : Rafael Pass, Karn Seth, Sidharth Telang
Erschienen in: Advances in Cryptology – CRYPTO 2014
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
We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of a class of algebraic “decisional” assumptions: roughly speaking, we require that for every nuPPT distribution
D
over two
constant-length
sequences
m
0
,
m
1
and auxiliary elements
z
such that all arithmetic circuits (respecting the multilinear restrictions and ending with a zero-test) are
constant
with overwhelming probability over (
m
b
,
z
),
b
∈ {0,1}, we have that encodings of
m
0
,
z
are computationally indistinguishable from encodings of
m
1
,
z
. Assuming the existence of semantically secure multilinear encodings and the LWE assumption, we demonstrate the existence of indistinguishability obfuscators for all polynomial-size circuits.