On multiparty garbling of arithmetic circuits

DOI10.1007/978-3-030-03332-3_1zbMath1447.94020OpenAlexW2794924128MaRDI QIDQ1710662

Aner Ben-Efraim

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_1

zbMATH Keywords

constant round MPCarithmetic garbled circuitsmultiparty garbling

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security

Cites Work

• Unnamed Item
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Concrete efficiency improvements for multiparty garbling with an honest majority
• Fast garbling of circuits under standard assumptions
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• On the Security of the “Free-XOR” Technique
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Two Halves Make a Whole
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
• Improved Garbled Circuit: Free XOR Gates and Applications
• LEGO for Two-Party Secure Computation
• Asynchronous Multiparty Computation: Theory and Implementation
• Secure Two-Party Computation Is Practical
• Foundations of Cryptography
• How to Garble Arithmetic Circuits
• Low cost constant round MPC combining BMR and oblivious transfer

This page was built for publication: On multiparty garbling of arithmetic circuits