On the round complexity of OT extension
From MaRDI portal
Publication:775997
Recommendations
Cited in
(11)- Black-box use of one-way functions is useless for optimal fair coin-tossing
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- An algebraic framework for universal and updatable SNARKs
- On complexity of round transformations
- Two-round MPC: information-theoretic and black-box
- Blazing fast OT for three-round UC OT extension
- Benchmarking the setup of updatable zk-SNARKs
- Lower-bounds on public-key operations in PIR
- Actively secure OT-extension from \(q\)-ary linear codes
- From privacy-only to simulatable OT: black-box, round-optimal, information-theoretic
- Updatable NIZKs from non-interactive zaps
This page was built for publication: On the round complexity of OT extension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775997)