Unbounded multi-party computation from learning with errors
type: Item
instance of: scholarly article
title: Unbounded multi-party computation from learning with errors
DOI: 10.1007/978-3-030-77886-6_26
author: Abhishek Jain
author: Zhengzhong Jin
author: Giulio Malavolta
author: Prabhanjan Ananth
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: 7440626
MaRDI profile type: Publication
full work available at URL: 978-3-030-77886-6 26
OpenAlex ID: W3158549038
cites work: Non-Interactive Secure Computation Based on Cut-and-Choose
cites work: Multi-key fully-homomorphic encryption in the plain model
cites work: How to Garble Arithmetic Circuits
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: Non-interactive secure computation from one-way functions
cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
cites work: Multiparty reusable non-interactive secure computation from LWE
cites work: Two-message statistically sender-private OT from LWE
cites work: Bonsai trees, or how to delegate a lattice basis
cites work: Reusable non-interactive secure computation
cites work: Public-Key Encryption Schemes with Auxiliary Inputs
cites work: Two-Round Secure MPC from Indistinguishability Obfuscation
cites work: Witness encryption and its applications
cites work: Two-round multiparty secure computation from minimal assumptions
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Reusable garbled circuits and succinct functional encryption
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: New constructions of reusable designated-verifier NIZKs
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Two Round Multiparty Computation via Multi-key FHE
cites work: Bi-Deniable Public-Key Encryption
cites work: Fuzzy Identity-Based Encryption
description: scientific article; zbMATH DE number 7440626