From FE combiners to secure MPC and back
From MaRDI portal
Publication:2175912
DOI10.1007/978-3-030-36030-6_9zbMath1455.94108OpenAlexW2990282446MaRDI QIDQ2175912
Saikrishna Badrinarayanan, Nathan Manohar, Aayush Jain, Amit Sahai, Prabhanjan V. Ananth
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_9
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Related Items (7)
Round-optimal and communication-efficient multiparty computation ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Combiners for functional encryption, unconditionally ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Amplifying the security of functional encryption, unconditionally
Cites Work
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- One way functions and pseudorandom generators
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- The edited truth
- Four round secure computation without setup
- A generic approach to constructing and proving verifiable random functions
- Promise zero knowledge and its applications to round optimal MPC
- Computationally private randomizing polynomials and their applications
- Indistinguishability Obfuscation: From Approximate to Exact
- Output-Compressing Randomized Encodings and Applications
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Functional Encryption Without Obfuscation
- 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
- Spooky Encryption and Its Applications
- Adaptively Secure Garbled Circuits from One-Way Functions
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Functional Encryption: New Perspectives and Lower Bounds
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Pseudorandom Functions and Lattices
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Cryptanalysis of the Multilinear Map over the Integers
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Functional Encryption: Definitions and Challenges
- Multi-key FHE from LWE, Revisited
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- 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
- A Framework for Efficient and Composable Oblivious Transfer
- Indistinguishability Obfuscation from Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Foundations of Homomorphic Secret Sharing
- Obfuscation of Probabilistic Circuits and Applications
- 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
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Reusable garbled circuits and succinct functional encryption
- Topics in Cryptology – CT-RSA 2005
- 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
- The Exact Round Complexity of Secure Computation
- Two Round Multiparty Computation via Multi-key FHE
- Obfustopia built on secret-key functional encryption
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Round-optimal secure multi-party computation
- Unnamed Item
- Unnamed Item
This page was built for publication: From FE combiners to secure MPC and back
