On the round complexity of OT extension
From MaRDI portal
Publication:775997
DOI10.1007/978-3-319-96878-0_19zbMath1457.94134OpenAlexW2795031435MaRDI QIDQ775997
Izaak Meckler, Sanjam Garg, Daniel Masny, Mohammad Mahmoody
Publication date: 30 June 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_19
Related Items (6)
An algebraic framework for universal and updatable SNARKs ⋮ Two-round MPC: information-theoretic and black-box ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Updatable NIZKs from non-interactive zaps ⋮ Blazing fast OT for three-round UC OT extension ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: On the round complexity of OT extension
