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:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=175599195&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 175599195
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Mar2024
      vid: 67
      iid: 3
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        175599195
        10.1145/3611095
      ppf: 97
      ppct: 9
      formats:
      tig:
        atl: Indistinguishability Obfuscation from Well-Founded Assumptions.
      aug:
        au:
          Jain, Aayush
          Lin, Huijia
          Sahai, Amit
        affil:
          CMU, Pittsburgh, PA, USA
          UW, Seattle, WA, USA
          UCLA, Los Angeles, CA, USA
      su:
        Public key cryptography
        Polynomials
        Polynomial time algorithms
        Data encryption
        Computer software
        Random number generators
      sug:
        subj:
          Public key cryptography
          Polynomials
          Polynomial time algorithms
          Data encryption
          Computer software
          Random number generators
      ab: 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.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2024
    holdings:
      @attributes:
        islocal: N