Actively secure garbled circuits with constant communication overhead in the plain model
From MaRDI portal
Publication:1690260
DOI10.1007/978-3-319-70503-3_1zbMath1406.94059OpenAlexW2765154061MaRDI QIDQ1690260
Yuval Ishai, Muthuramakrishnan Venkitasubramaniam, Carmit Hazay
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_1
Related Items (6)
On the round complexity of black-box secure MPC ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Private polynomial commitments and applications to MPC ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ The price of active security in cryptographic protocols
This page was built for publication: Actively secure garbled circuits with constant communication overhead in the plain model
