Indistinguishability Obfuscation with Non-trivial Efficiency

DOI10.1007/978-3-662-49387-8_17zbMath1395.94298OpenAlexW2295160013MaRDI QIDQ2798810

Rafael Pass, Karn Seth, Huijia Lin, Sidharth Telang

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49387-8_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (24)

One-Way Functions and (Im)perfect Obfuscation ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Proofs of Work from worst-case assumptions ⋮ From FE combiners to secure MPC and back ⋮ A map of witness maps: new definitions and connections ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Indistinguishability obfuscation ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ On the complexity of compressing obfuscation ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Cryptography with Updates ⋮ Candidate iO from homomorphic encryption schemes ⋮ Simple and generic constructions of succinct functional encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Candidate obfuscation via oblivious LWE sampling

This page was built for publication: Indistinguishability Obfuscation with Non-trivial Efficiency