Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
From MaRDI portal
Publication:2874522
DOI10.1007/978-3-662-44371-2_28zbMath1343.94076OpenAlexW386218400MaRDI QIDQ2874522
Sidharth Telang, Rafael Pass, Karn Seth
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_28
Related Items
One-Way Functions and (Im)perfect Obfuscation ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ On the bit security of cryptographic primitives ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Secret-sharing for NP ⋮ Proofs of Work from worst-case assumptions ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On virtual grey box obfuscation for general circuits ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Indistinguishability obfuscation ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Functional broadcast encryption with applications to data sharing for cloud storage ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ On the complexity of compressing obfuscation ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Reusable fuzzy extractors for low-entropy distributions ⋮ Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ Cryptographic Assumptions: A Position Paper ⋮ Obfustopia built on secret-key functional encryption ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Cutting-Edge Cryptography Through the Lens of Secret Sharing ⋮ Functional Encryption Without Obfuscation ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Obfuscating circuits via composite-order graded encoding ⋮ Constrained pseudorandom functions from functional encryption ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Obfuscation Combiners ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
