Two-round adaptively secure multiparty computation from standard assumptions
type: Item
instance of: scholarly article
title: Two-round adaptively secure multiparty computation from standard assumptions
zbMATH Open document ID: 1443.94046
DOI: 10.1007/978-3-030-03807-6_7
author: Fabrice Benhamouda
author: Huijia Lin
author: Antigoni Polychroniadou
author: Muthuramakrishnan Venkitasubramaniam
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q06
zbMATH DE Number: 6992091
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 7
OpenAlex ID: W2899423027
cites work: Removing Erasures with Explainable Hash Proof Systems
cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
cites work: Hash proof systems over lattices revisited
cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
cites work: Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
cites work: Foundations of Homomorphic Secret Sharing
cites work: Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
cites work: Universally Composable Security with Global Setup
cites work: Q4228521
cites work: Q4783717
cites work: Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
cites work: Universally composable two-party and multi-party secure computation
cites work: Better Two-Round Adaptive Multi-party Computation
cites work: Equivocating Yao
cites work: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
cites work: Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
cites work: Multi-identity and Multi-key Leveled FHE from Learning with Errors
cites work: Q4737235
cites work: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
cites work: Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
cites work: Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
cites work: Two-Round Secure MPC from Indistinguishability Obfuscation
cites work: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
cites work: Two-round multiparty secure computation from minimal assumptions
cites work: Probabilistic encryption
cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery
cites work: Smooth projective hashing and two-message oblivious transfer
cites work: The Group of Signed Quadratic Residues and Applications
cites work: Two Round Multiparty Computation via Multi-key FHE
cites work: Efficient oblivious transfer protocols
cites work: Multi-key FHE from LWE, Revisited
cites work: A Framework for Efficient and Composable Oblivious Transfer
description: scientific article; zbMATH DE number 6992091