Indistinguishability Obfuscation from Compact Functional Encryption
From MaRDI portal
Publication:3457116
DOI10.1007/978-3-662-47989-6_15zbMath1336.94035OpenAlexW1419302722MaRDI QIDQ3457116
Abhishek Jain, Prabhanjan V. Ananth
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_15
Related Items (93)
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 ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ Upgrading to functional encryption ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound ⋮ 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 ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ 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 ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ 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-input Functional Encryption with Unbounded-Message Security ⋮ Verifiable Functional Encryption ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ 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 ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ More efficient verifiable functional encryption ⋮ Universal ring signatures in the standard model ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Streaming functional encryption ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Indistinguishability obfuscation ⋮ Multi-party functional encryption ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Functional broadcast encryption with applications to data sharing for cloud storage ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ 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 ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Cryptography with Updates ⋮ Candidate iO from homomorphic encryption schemes ⋮ 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 ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Perfect Structure on the Edge of Chaos ⋮ Obfustopia built on secret-key functional encryption ⋮ Functional Encryption Without Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Constrained pseudorandom functions from 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 ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Combiners for functional encryption, unconditionally ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ 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 ⋮ Obfuscation Combiners ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Unnamed Item ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
Cites Work
- Computationally private randomizing polynomials and their applications
- Practical Multilinear Maps over the Integers
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Constrained Pseudorandom Functions and Their Applications
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Candidate Multilinear Maps from Ideal Lattices
- How to Garble RAM Programs?
- Functional Signatures and Pseudorandom Functions
- Protecting Obfuscation against Algebraic Attacks
- Garbled RAM Revisited
- Multi-input Functional Encryption
- On Extractability Obfuscation
- Two-Round Secure MPC from Indistinguishability Obfuscation
This page was built for publication: Indistinguishability Obfuscation from Compact Functional Encryption
