Indistinguishability Obfuscation from Well-Founded Assumptions.

This article discusses the application of indistinguishability obfuscation for circuits in the context of the pseudo-canonicalization. The article first discusses arithmetic circuits and the use of pseudo-canonical form for polynomials when hiding implementation choices, then applies this to computer programs with discussion of public-key cryptography and program obfuscation. Then the indistinguishability obfuscator for circuits is defined, its assumptions are detailed, and its applications are discussed.