Indistinguishability Obfuscation from Functional Encryption
From MaRDI portal
Publication:4625660
DOI10.1145/3234511zbMath1407.94087OpenAlexW2900822322WikidataQ123120539 ScholiaQ123120539MaRDI QIDQ4625660
Nir Bitansky, Vinod Vaikuntanathan
Publication date: 25 February 2019
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3234511
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (59)
One-Way Functions and (Im)perfect Obfuscation ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Multi-input quadratic functional encryption from pairings ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Dynamic collusion bounded functional encryption from identity-based encryption ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Optimal bounded-collusion secure functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Quantum attribute-based encryption: a comprehensive study ⋮ Efficient and scalable universal circuits ⋮ 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 ⋮ On virtual grey box obfuscation for general circuits ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Adaptive multiparty NIKE ⋮ Collusion-resistant functional encryption for RAMs ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Universal ring signatures in the standard model ⋮ Streaming functional encryption ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Functional encryption for cubic polynomials and implementation ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ On the complexity of compressing obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Simple and generic constructions of succinct functional encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Simple and efficient FE for quadratic functions ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Candidate iO from homomorphic encryption schemes ⋮ Combiners for functional encryption, unconditionally ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Unnamed Item
This page was built for publication: Indistinguishability Obfuscation from Functional Encryption
