On multiparty garbling of arithmetic circuits

DOI10.1007/978-3-030-03332-3_1MaRDI QIDQ1710662zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Full-threshold actively-secure multiparty arithmetic circuit garbling
• Efficient scalable constant-round MPC via garbled circuits
• How to garble arithmetic circuits
• Improved Garbled Circuit: Free XOR Gates and Applications
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security

Cites work

• scientific article; zbMATH DE number 1842488 (Why is no real title available?)
• Asynchronous Multiparty Computation: Theory and Implementation
• Concrete efficiency improvements for multiparty garbling with an honest majority
• Efficient constant round multi-party computation combining BMR and SPDZ
• Fast garbling of circuits under standard assumptions
• Faster secure multi-party computation of AES and DES using lookup tables
• Foundations of Cryptography
• How to Garble Arithmetic Circuits
• Improved Garbled Circuit: Free XOR Gates and Applications
• LEGO for Two-Party Secure Computation
• Low cost constant round MPC combining BMR and oblivious transfer
• Multiparty Computation from Somewhat Homomorphic Encryption
• On the security of the ``Free-XOR technique
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Secure two-party computation is practical
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Two halves make a whole: reducing data transfer in garbled circuits using half gates

Cited in

(11)

• Improved primitives for MPC over mixed arithmetic-binary circuits
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Fast garbling of circuits over 3-valued logic
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
• How to garble mixed circuits that combine Boolean and arithmetic computations
• New ways to garble arithmetic circuits
• How to garble arithmetic circuits
• Full-threshold actively-secure multiparty arithmetic circuit garbling
• Arithmetic garbling from bilinear maps

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

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