Optimizing authenticated garbling for faster secure two-party computation

DOI10.1007/978-3-319-96878-0_13zbMath1457.94147OpenAlexW2806373377MaRDI QIDQ775980

Mike Rosulek, Samuel Ranellucci, Xiao Wang, Jonathan N. 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

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

Related Items (10)

Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Secure computation with preprocessing via function secret sharing ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ High-throughput secure three-party computation with an honest majority ⋮ Authenticated garbling from simple correlations ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Going beyond dual execution: MPC for functions with efficient verification

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