Multiparty reusable non-interactive secure computation from LWE
type: Item
instance of: scholarly article
title: Multiparty reusable non-interactive secure computation from LWE
DOI: 10.1007/978-3-030-77886-6_25
author: Fabrice Benhamouda
author: Aayush Jain
author: Ilan Komargodski
author: Huijia Lin
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440625
MaRDI profile type: Publication
full work available at URL: 978-3-030-77886-6 25
OpenAlex ID: W3157988597
cites work: Non-Interactive Secure Computation Based on Cut-and-Choose
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Q4228459
cites work: Q4938616
cites work: Generating Shorter Bases for Hard Random Lattices
cites work: From FE combiners to secure MPC and back
cites work: Round-optimal secure multiparty computation with honest majority
cites work: Multi-key fully-homomorphic encryption in the plain model
cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: Secure MPC: laziness leads to GOD
cites work: Non-interactive secure computation from one-way functions
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Reusable two-round MPC from DDH
cites work: Non-Interactive Secure Multiparty Computation
cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
cites work: Mr NISC: multiparty reusable non-interactive secure computation
cites work: Key Homomorphic PRFs and Their Applications
cites work: Two-message statistically sender-private OT from LWE
cites work: Four round secure computation without setup
cites work: Classical hardness of learning with errors
cites work: Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
cites work: Lattice-based FHE as secure as PKE
cites work: Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Reusable non-interactive secure computation
cites work: Multi-identity and Multi-key Leveled FHE from Learning with Errors
cites work: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: A minimal model for secure computation (extended abstract)
cites work: Two-Round Secure MPC from Indistinguishability Obfuscation
cites work: Two-round MPC: information-theoretic and black-box
cites work: Two-round multiparty secure computation minimizing public key operations
cites work: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
cites work: Two-round multiparty secure computation from minimal assumptions
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Q4542532
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery
cites work: Efficient Non-interactive Secure Computation
cites work: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Two Round Multiparty Computation via Multi-key FHE
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: Multi-key FHE from LWE, Revisited
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 7440625