Multiparty reusable non-interactive secure computation from LWE
From MaRDI portal
Publication:2056764
DOI10.1007/978-3-030-77886-6_25OpenAlexW3157988597MaRDI QIDQ2056764FDOQ2056764
Authors: 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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68Mxx)
Cites Work
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- 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
- Title not available (Why is that?)
- Classical hardness of learning with errors
- Leveled fully homomorphic signatures from standard lattices
- Title not available (Why is that?)
- Generating shorter bases for hard random lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Trapdoors for lattices: simpler, tighter, faster, smaller
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Advances in Cryptology - EUROCRYPT 2004
- A minimal model for secure computation (extended abstract)
- Title not available (Why is that?)
- Pseudorandom functions and lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- 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
- Two-round multiparty secure computation minimizing public key operations
- Non-interactive secure multiparty computation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- 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
- Round-optimal secure multiparty computation with honest majority
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Key homomorphic PRFs and their applications
- New and improved key-homomorphic pseudorandom functions
- 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
- Two round multiparty computation via multi-key FHE
- Two-round secure MPC from indistinguishability obfuscation
- Non-interactive secure computation based on cut-and-choose
- Non-interactive secure computation from one-way functions
- Reusable non-interactive secure computation
- Lattice-based FHE as secure as PKE
- 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
- Secure MPC: laziness leads to GOD
Cited In (16)
- mrNISC from LWE with polynomial modulus
- Reusable non-interactive secure computation
- Reusable two-round MPC from LPN
- Parallelizable delegation from LWE
- Black-box reusable NISC with random oracles
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Secure quantum computation with classical communication
- Maliciously-secure MrNISC in the plain model
- Reusable secure computation in the plain model
- Witness encryption for succinct functional commitments and applications
- Multiparty reusable non-interactive secure computation from LWE
- Unbounded multi-party computation from learning with errors
- Malicious security for SCALES. Outsourced computation with ephemeral servers
- Two-round maliciously secure computation with super-polynomial simulation
- SCALES. MPC with small clients and larger ephemeral servers
- mrNISC from LWE with polynomial modulus
This page was built for publication: Multiparty reusable non-interactive secure computation from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056764)
