The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO

Geoffroy Couteau
Thomas Agrikola
  • Fonction : Auteur
Dennis Hofheinz
  • Fonction : Auteur

Résumé

We consider the problem of removing subexponential reductions to indistinguishability obfuscation (iO) in the context of obfuscating probabilistic programs. Specifically, we show how to apply complexity absorption (Zhandry, Crypto 2016) to the recent notion of probabilistic indistinguishability obfuscation (piO, Canetti et al., TCC 2015). As a result, we obtain a variant of piO which allows to obfuscate a large class of probabilistic programs, from polynomially secure indistinguishability obfuscation and extremely lossy functions. Particularly, our piO variant is able to obfuscate circuits with specific input domains regardless of the performed computation. We then revisit several (direct or indirect) applications of piO, and obtain a fully homomorphic encryption scheme (without circular security assumptions), a multi-key fully homomorphic encryption scheme with threshold decryption, an encryption scheme secure under arbitrary key-dependent messages, a spooky encryption scheme for all circuits, a function secret sharing scheme with additive reconstruction for all circuits, all from polynomially secure iO, extremely lossy functions, and, depending on the scheme, also other (but polynomial and comparatively mild) assumptions. All of these assumptions are implied by polynomially secure iO and the (non-polynomial, but very well-investigated) exponential DDH assumption. Previously, all the above applications required to assume the subexponential security of iO (and more standard assumptions).
Fichier principal
Vignette du fichier
2018-470.pdf (760 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03374134 , version 1 (11-10-2021)

Identifiants

Citer

Geoffroy Couteau, Thomas Agrikola, Dennis Hofheinz. The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO. PKC 2020 - IACR International Conference on Public-Key Cryptography, Apr 2020, Édimbourg, United Kingdom. pp.187-219, ⟨10.1007/978-3-030-45374-9_7⟩. ⟨hal-03374134⟩
27 Consultations
101 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More