Combiners for functional encryption, unconditionally
From MaRDI portal
Publication:2055605
DOI10.1007/978-3-030-45721-1_6zbMath1479.94193OpenAlexW3013586738MaRDI QIDQ2055605
Amit Sahai, Nathan Manohar, Aayush Jain
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_6
Related Items (3)
Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Subversion-resilient public key encryption with practical watchdogs ⋮ Amplifying the security of functional encryption, unconditionally
Cites Work
- Two-round MPC: information-theoretic and black-box
- Two-round multiparty secure computation from minimal assumptions
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Threshold cryptosystems from threshold fully homomorphic encryption
- 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
- From FE combiners to secure MPC and back
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Sum-of-squares meets program obfuscation, revisited
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Indistinguishability Obfuscation: From Approximate to Exact
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- 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
- Adaptively Secure Garbled Circuits from One-Way Functions
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Cryptanalysis of the Multilinear Map over the Integers
- Function Secret Sharing
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Functional Encryption: Definitions and Challenges
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- From Selective to Adaptive Security in Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- Founding Cryptography on Oblivious Transfer – Efficiently
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
- Indistinguishability Obfuscation from Functional Encryption
- A Note on Perfect Correctness by Derandomization
- Breaking the Sub-Exponential Barrier in Obfustopia
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Fuzzy Identity-Based Encryption
- OT-Combiners via Secure Computation
- Reusable garbled circuits and succinct functional encryption
- 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
- Two Round Multiparty Computation via Multi-key FHE
- Obfustopia built on secret-key functional encryption
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: Combiners for functional encryption, unconditionally
