Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
From MaRDI portal
Publication:5738872
DOI10.1007/978-3-319-56620-7_4zbMath1410.94039OpenAlexW2593527038MaRDI QIDQ5738872
Aayush Jain, Amit Sahai, Prabhanjan V. Ananth
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_4
Related Items (20)
A note on perfect correctness by derandomization ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ 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 FE combiners to secure MPC and back ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the security of functional encryption in the generic group model ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ On the complexity of compressing obfuscation ⋮ Cryptography with Updates ⋮ Simple and generic constructions of succinct functional encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ Combiners for functional encryption, unconditionally ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Amplifying the security of functional encryption, unconditionally
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Indistinguishability Obfuscation: From Approximate to Exact
- Cryptographic Assumptions: A Position Paper
- Time-Lock Puzzles from Randomized Encodings
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH Map
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation Combiners
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- Secure Obfuscation in a Weak Multilinear Map Model
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Best-Possible Obfuscation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- On the Power of Correlated Randomness in Secure Computation
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Breaking the Sub-Exponential Barrier in Obfustopia
- Watermarking cryptographic capabilities
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Protecting Obfuscation against Algebraic Attacks
- Multi-input Functional Encryption
- On the Cryptographic Complexity of the Worst Functions
This page was built for publication: Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
