Indistinguishability obfuscation from circular security
From MaRDI portal
Publication:6087040
DOI10.1145/3406325.3451070OpenAlexW3167778596MaRDI QIDQ6087040
Publication date: 14 November 2023
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3406325.3451070
Related Items (20)
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Incompressible cryptography ⋮ COA-secure obfuscation and applications ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Secure software leasing from standard assumptions ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ On the complexity of compressing obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption
This page was built for publication: Indistinguishability obfuscation from circular security
