Amplifying the security of functional encryption, unconditionally
From MaRDI portal
Publication:2096505
DOI10.1007/978-3-030-56784-2_24zbMath1504.94151OpenAlexW3048817357MaRDI QIDQ2096505
Amit Sahai, Nathan Manohar, Alexis Korb, Aayush Jain
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_24
Related Items (4)
Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Functional encryption with secure key leasing ⋮ Candidate iO from homomorphic encryption schemes ⋮ Subversion-resilient public key encryption with practical watchdogs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boosting and hard-core set construction
- On the complexity of simulating auxiliary input
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- A generic approach to constructing and proving verifiable random functions
- Combiners for functional encryption, unconditionally
- From FE combiners to secure MPC and back
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Simultaneous amplification: the case of non-interactive zero-knowledge
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation Combiners
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Adaptively Secure Garbled Circuits from One-Way Functions
- A Uniform Min-Max Theorem with Applications in Cryptography
- Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
- Functional Encryption: Definitions and Challenges
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
- An Efficient Parallel Repetition Theorem
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- Predicate Encryption for Circuits from LWE
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Efficiently Simulating High Min-entropy Sources in the Presence of Side Information
- Key agreement from weak bit agreement
- Robuster Combiners for Oblivious Transfer
- Oblivious Transfer from Weak Noisy Channels
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Indistinguishability Obfuscation from Functional Encryption
- Amplification of Chosen-Ciphertext Security
- How to use indistinguishability obfuscation
- Breaking the Sub-Exponential Barrier in Obfustopia
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Oblivious-Transfer Amplification
- OT-Combiners via Secure Computation
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Reusable garbled circuits and succinct functional encryption
- Theory of Cryptography
- 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
- How to Fake Auxiliary Input
- Obfustopia built on secret-key functional encryption
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: Amplifying the security of functional encryption, unconditionally
