TY - GEN
T1 - Affine determinant programs
T2 - 11th Innovations in Theoretical Computer Science Conference, ITCS 2020
AU - Bartusek, James
AU - Ishai, Yuval
AU - Jain, Aayush
AU - Ma, Fermi
AU - Sahai, Amit
AU - Zhandry, Mark
N1 - Publisher Copyright:
© James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, and Mark Zhandry.
PY - 2020/1
Y1 - 2020/1
N2 - An affine determinant program ADP: {0, 1}n → {0, 1} is specified by a tuple (A, B1, . . ., Bn) of square matrices over Fq and a function Eval: Fq → {0, 1}, and evaluated on x ∈ {0, 1}n by computing Eval(det(A + Pi∈[n] xiBi)). In this work, we suggest ADPs as a new framework for building general-purpose obfuscation and witness encryption. We provide evidence to suggest that constructions following our ADP-based framework may one day yield secure, practically feasible obfuscation. As a proof-of-concept, we give a candidate ADP-based construction of indistinguishability obfuscation (iO) for all circuits along with a simple witness encryption candidate. We provide cryptanalysis demonstrating that our schemes resist several potential attacks, and leave further cryptanalysis to future work. Lastly, we explore practically feasible applications of our witness encryption candidate, such as public-key encryption with near-optimal key generation.
AB - An affine determinant program ADP: {0, 1}n → {0, 1} is specified by a tuple (A, B1, . . ., Bn) of square matrices over Fq and a function Eval: Fq → {0, 1}, and evaluated on x ∈ {0, 1}n by computing Eval(det(A + Pi∈[n] xiBi)). In this work, we suggest ADPs as a new framework for building general-purpose obfuscation and witness encryption. We provide evidence to suggest that constructions following our ADP-based framework may one day yield secure, practically feasible obfuscation. As a proof-of-concept, we give a candidate ADP-based construction of indistinguishability obfuscation (iO) for all circuits along with a simple witness encryption candidate. We provide cryptanalysis demonstrating that our schemes resist several potential attacks, and leave further cryptanalysis to future work. Lastly, we explore practically feasible applications of our witness encryption candidate, such as public-key encryption with near-optimal key generation.
KW - Obfuscation
KW - Witness encryption
UR - http://www.scopus.com/inward/record.url?scp=85078005982&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.ITCS.2020.82
DO - 10.4230/LIPIcs.ITCS.2020.82
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85078005982
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 11th Innovations in Theoretical Computer Science Conference, ITCS 2020
A2 - Vidick, Thomas
Y2 - 12 January 2020 through 14 January 2020
ER -