Efficient compiler to covert security with public verifiability for honest majority MPC
type: Item
instance of: scholarly article
title: Efficient compiler to covert security with public verifiability for honest majority MPC
DOI: 10.1007/978-3-031-09234-3_33
author: Thomas Attema
author: Vincent Dunning
author: Maarten Everts
author: Peter Langenkamp
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7614785
zbMATH Keywords: multi-party computation
zbMATH Keywords: compiler
zbMATH Keywords: covert security
zbMATH Keywords: honest majority
MaRDI profile type: Publication
full work available at URL: 978-3-031-09234-3 33
OpenAlex ID: W4285079205
cites work: Calling Out Cheaters: Covert Security with Public Verifiability
cites work: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
cites work: Q4035736
cites work: Efficient fully secure computation via distributed zero-knowledge proofs
cites work: From Passive to Covert Security at Low Cost
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Black-box transformations from passive to covert security with public verifiability
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Generic compiler for publicly verifiable covert multi-party computation
cites work: Efficient Two Party and Multi Party Computation Against Covert Adversaries
cites work: Guaranteed output delivery comes free in honest majority MPC
cites work: Covert security with public verifiability: faster, leaner, and simpler
cites work: Public Verifiability in the Covert Model (Almost) for Free
cites work: Q4941853
cites work: How to share a secret
cites work: Publicly Verifiable Secret Sharing
description: scientific article; zbMATH DE number 7614785