Going beyond dual execution: MPC for functions with efficient verification
type: Item
instance of: scholarly article
title: Going beyond dual execution: MPC for functions with efficient verification
DOI: 10.1007/978-3-030-45388-6_12
author: Carmit Hazay
author: Abhi Shelat
author: Muthuramakrishnan Venkitasubramaniam
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436977
zbMATH Keywords: secure computation
zbMATH Keywords: semi-honest security
zbMATH Keywords: dual execution
zbMATH Keywords: greedy algorithms
MaRDI profile type: Publication
full work available at URL: 978-3-030-45388-6 12
OpenAlex ID: W3021910883
cites work: Secure arithmetic computation with constant computational overhead
cites work: Q4035736
cites work: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
cites work: Fast large-scale honest-majority MPC for malicious adversaries
cites work: Fast distributed RSA key generation for semi-honest and malicious adversaries
cites work: Q4145647
cites work: The round complexity of verifiable secret sharing and secure multicast
cites work: Circuits resilient to additive attacks with applications to secure computation
cites work: Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
cites work: Binary AMD Circuits from Secure Multiparty Computation
cites work: Foundations of Cryptography
cites work: Actively secure garbled circuits with constant communication overhead in the plain model
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Secure Arithmetic Computation with No Honest Majority
cites work: A simpler minimum spanning tree verification algorithm
cites work: Overdrive: making SPDZ great again
cites work: Optimizing authenticated garbling for faster secure two-party computation
cites work: Efficient, Oblivious Data Structures for MPC
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Secure two-party computation via cut-and-choose oblivious transfer
cites work: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
cites work: Public Key Cryptography - PKC 2006
cites work: Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
cites work: Algorithms – ESA 2004
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: LEGO for Two-Party Secure Computation
cites work: Maximum matchings in general graphs through randomization
Recommended article: Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings
Recommended article: Dynamic symbolic verification of MPI programs
Recommended article: Q4733386
Recommended article: Verifying Optimizations for Concurrent Programs
Recommended article: Runtime verification with minimal intrusion through parallelism
description: scientific article; zbMATH DE number 7436977