On the round complexity of OT extension

DOI10.1007/978-3-319-96878-0_19MaRDI QIDQ775997zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler

Publication date 30 June 2020

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

zbMATH Keywords

OT extension protocolsemi-honest settingsymmetric key primitives

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• More efficient oblivious transfer extensions
• More efficient oblivious transfer extensions with security for malicious adversaries
• Actively secure OT extension with optimal overhead
• On the feasibility of extending oblivious transfer
• On the feasibility of extending oblivious transfer

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)