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 compute...

Descripción completa

Detalles Bibliográficos
Publicado en:	Communications of the ACM Vol. 67; no. 3; pp. 97 - 106
Autores principales:	Jain, Aayush, Lin, Huijia, Sahai, Amit
Formato:	Artículo
Publicado:	Association for Computing Machinery Mar2024
Materias:	Public key cryptography Polynomials Polynomial time algorithms Data encryption Computer software Random number generators
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	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.