Optimizing authenticated garbling for faster secure two-party computation

DOI10.1007/978-3-319-96878-0_13MaRDI QIDQ775980zbMATH OpenOpenAlexFDO

Authors Samuel Ranellucci, Mike Rosulek, Xiao Wang, Jonathan Katz

Publication date 30 June 2020

Full work available at URL https://doi.org/10.1007/978-3-319-96878-0_13

zbMATH Keywords

malicious secure two-party computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Amortizing Garbled Circuits
• Faster secure two-party computation in the single-execution setting
• Authenticated garbling from simple correlations
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
• Two halves make a whole: reducing data transfer in garbled circuits using half gates

Cited in

(13)

• Actively secure garbled circuits with constant communication overhead in the plain model
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• Constant-round multiparty private function evaluation with (quasi-)linear complexities
• Secure computation with preprocessing via function secret sharing
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Actively secure half-gates with minimum overhead under duplex networks
• Tri-state circuits. A circuit model that captures RAM
• Putting the online phase on a diet: covert security from short MACs
• Going beyond dual execution: MPC for functions with efficient verification
• Low cost constant round MPC combining BMR and oblivious transfer
• Authenticated garbling from simple correlations
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
• High-throughput secure three-party computation with an honest majority

This page was built for publication: Optimizing authenticated garbling for faster secure two-party computation

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