Multiparty reusable non-interactive secure computation from LWE
From MaRDI portal
Publication:2056764
DOI10.1007/978-3-030-77886-6_25OpenAlexW3157988597MaRDI QIDQ2056764
Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_25
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Related Items (11)
Reusable Two-Round MPC from LPN ⋮ Black-box reusable NISC with random oracles ⋮ Maliciously-secure MrNISC in the plain model ⋮ SCALES. MPC with small clients and larger ephemeral servers ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Reusable secure computation in the plain model ⋮ Secure quantum computation with classical communication ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors
Cites Work
- Two-round multiparty secure computation minimizing public key operations
- Two-round MPC: information-theoretic and black-box
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Four round secure computation without setup
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Non-interactive secure computation from one-way functions
- Round-optimal secure multiparty computation with honest majority
- Multi-key fully-homomorphic encryption in the plain model
- Multiparty reusable non-interactive secure computation from LWE
- Reusable two-round MPC from DDH
- Mr NISC: multiparty reusable non-interactive secure computation
- From FE combiners to secure MPC and back
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Reusable non-interactive secure computation
- Secure MPC: laziness leads to GOD
- A minimal model for secure computation (extended abstract)
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Non-Interactive Secure Multiparty Computation
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Lattice-based FHE as secure as PKE
- Efficient Non-interactive Secure Computation
- Multi-key FHE from LWE, Revisited
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Generating Shorter Bases for Hard Random Lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Non-Interactive Secure Computation Based on Cut-and-Choose
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiparty reusable non-interactive secure computation from LWE
