From privacy-only to simulatable OT: black-box, round-optimal, information-theoretic

DOI10.4230/LIPICS.ITC.2022.5zbMATH Open1542.94134MaRDI QIDQ6561684FDOQ6561684

Authors: Varun Madathil, Chris Orsini, Alessandra Scafuro, D. Venturi 

Publication date: 25 June 2024

Recommendations

• What Security Can We Achieve Within 4 Rounds?
• On the round complexity of OT extension
• What security can we achieve within 4 rounds?
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Round-optimal black-box secure computation from two-round malicious OT

zbMATH Keywords

oblivious transfermalicious securityplain modelblack-box compiler

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20)

This page was built for publication: From privacy-only to simulatable OT: black-box, round-optimal, information-theoretic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561684)