Synergy between circuit obfuscation and circuit minimization

DOI10.4230/LIPICS.APPROX/RANDOM.2023.31MaRDI QIDQ6663046zbMATH OpenFDO

Authors Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.31

zbMATH Keywords

circuit lower boundscomplexity classesindistinguishability obfuscationminimal circuit size problem (MCSP)separation of classesstatistical distance

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(1)

• Gap MCSP is not (Levin) NP-complete in obfustopia

This page was built for publication: Synergy between circuit obfuscation and circuit minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663046)