2014 | OriginalPaper | Chapter
Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
Authors : Rafael Pass, Karn Seth, Sidharth Telang
Published in: Advances in Cryptology – CRYPTO 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.