Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
From MaRDI portal
Publication:2820477
DOI10.1007/978-3-662-49890-3_2zbMath1347.94046OpenAlexW2414682689MaRDI QIDQ2820477
Publication date: 9 September 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_2
Related Items (36)
One-Way Functions and (Im)perfect Obfuscation ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Proofs of Work from worst-case assumptions ⋮ From FE combiners to secure MPC and back ⋮ Multilinear maps from obfuscation ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Streaming functional encryption ⋮ Indistinguishability obfuscation ⋮ Unnamed Item ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ On the complexity of compressing obfuscation ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ 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 ⋮ Obfuscation Combiners ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
This page was built for publication: Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
