Going beyond dual execution: MPC for functions with efficient verification

DOI10.1007/978-3-030-45388-6_12OpenAlexW3021910883MaRDI QIDQ2055697

Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Carmit Hazay

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

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

Related Items (1)

Actively secure half-gates with minimum overhead under duplex networks

Cites Work

• Unnamed Item
• Unnamed Item
• Fast large-scale honest-majority MPC for malicious adversaries
• Optimizing authenticated garbling for faster secure two-party computation
• A proof of security of Yao's protocol for two-party computation
• Overdrive: making SPDZ great again
• Secure arithmetic computation with constant computational overhead
• Actively secure garbled circuits with constant communication overhead in the plain model
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Secure two-party computation via cut-and-choose oblivious transfer
• Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
• A New Approach to Practical Active-Secure Two-Party Computation
• Efficient, Oblivious Data Structures for MPC
• Maximum matchings in general graphs through randomization
• Binary AMD Circuits from Secure Multiparty Computation
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• LEGO for Two-Party Secure Computation
• Foundations of Cryptography
• A simpler minimum spanning tree verification algorithm
• The round complexity of verifiable secret sharing and secure multicast
• Circuits resilient to additive attacks with applications to secure computation
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Algorithms – ESA 2004
• Public Key Cryptography - PKC 2006
• Low cost constant round MPC combining BMR and oblivious transfer

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