Going beyond dual execution: MPC for functions with efficient verification

DOI10.1007/978-3-030-45388-6_12MaRDI QIDQ2055697OpenAlexFDO

Authors Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam

Publication date 1 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-45388-6_12

zbMATH Keywords

greedy algorithmssecure computationdual executionsemi-honest security

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings
• Dynamic symbolic verification of MPI programs
• Publication:4733386
• Verifying optimizations for concurrent programs
• Runtime verification with minimal intrusion through parallelism

Cites work

• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 3573787 (Why is no real title available?)
• A new approach to practical active-secure two-party computation
• A proof of security of Yao's protocol for two-party computation
• A simpler minimum spanning tree verification algorithm
• Actively secure garbled circuits with constant communication overhead in the plain model
• Algorithms – ESA 2004
• Binary AMD circuits from secure multiparty computation
• Circuits resilient to additive attacks with applications to secure computation
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Efficient constant round multi-party computation combining BMR and SPDZ
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• Efficient, oblivious data structures for MPC
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Fast large-scale honest-majority MPC for malicious adversaries
• Foundations of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• Garbled circuits checking garbled circuits: more efficient and secure two-party computation
• LEGO for Two-Party Secure Computation
• Low cost constant round MPC combining BMR and oblivious transfer
• Maximum matchings in general graphs through randomization
• Optimizing authenticated garbling for faster secure two-party computation
• Overdrive: making SPDZ great again
• Public Key Cryptography - PKC 2006
• Secure Arithmetic Computation with No Honest Majority
• Secure arithmetic computation with constant computational overhead
• Secure two-party computation via cut-and-choose oblivious transfer
• The round complexity of verifiable secret sharing and secure multicast

Cited in

(2)

• Actively secure half-gates with minimum overhead under duplex networks
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead

This page was built for publication: Going beyond dual execution: MPC for functions with efficient verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055697)