aqora

On Multiparty Garbling of Arithmetic Circuits

Aner Ben-Efraim

Lecture notes in computer scienceJan 1, 201814 citations

Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling

Eleftheria Makri, Tim Wood

Lecture notes in computer scienceJan 1, 20211 citation

Revisiting Covert Multiparty Computation.

Geoffroy Couteau

Jan 1, 20162 citations

Multiparty Computation with Faulty Majority

Donald Beaver, Shaft Goldwasser

Springer eBooksNov 9, 200740 citations

Multiparty Computation with Minimal Overhead Without Circuit Transformation

Aditya Hegde, Phuoc Van Long Pham, Mingyuan Wang

Lecture notes in computer scienceJan 1, 20260 citations

On Multiparty Garbling of Arithmetic Circuits.

Aner Ben-Efraim

We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits recently presented by Ball, Malkin, and Rosulek (ACM CCS 2016) into the multiparty garbling paradigm initially introduced by Beaver, Micali, and Rogaway (STOC ’90). This is the first work that studies arithmetic garbled circuits in the multiparty setting. Using mixed Boolean-arithmetic circuits allows more efficient secure computation of functions that naturally combine Boolean and arithmetic computations. Our garbled circuits are secure in the semi-honest model, under the same hardness assumptions as Ball et al., and can be efficiently and securely computed in constant rounds assuming an honest majority.We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits recently presented by Ball, Malkin, and Rosulek (ACM CCS 2016) into the multiparty garbling paradigm initially introduced by Beaver, Micali, and Rogaway (STOC ’90). This is the first work that studies arithmetic garbled circuits in the multiparty setting. Using mixed Boolean-arithmetic circuits allows more efficient secure computation of functions that naturally combine Boolean and arithmetic computations. Our garbled circuits are secure in the semi-honest model, under the same hardness assumptions as Ball et al., and can be efficiently and securely computed in constant rounds assuming an honest majority.

Jan 1, 20171 citation

Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority

Related papers

Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority

Related papers