
Efficient Laconic Oblivious Transfer with Malicious Security
Efficient Laconic Oblivious Transfer with Malicious Security is an ePrint paper (2026/2593, ASIACRYPT 2026 revision) giving the first maliciously secure laconic OT that uses its primitives only as black boxes. It adds equivocal vector commitments and maliciously secure witness encryption to the commitment-plus-witness-encryption paradigm. Security is proven in the UC model against malicious senders and in the context model against malicious receivers. Instantiations use LWE and bilinear Diffie-Hellman assumptions in the standard model.
TL;DR Presents the first black-box laconic oblivious transfer secure against malicious parties, built from equivocal vector commitments and witness encryption.
Organisations named here
- bilinear Diffie-Hellman
- equivocal vector commitments
- laconic oblivious transfer
- LWE
- universal composability
- witness encryption
Technologies named here
- Equivocal vector commitments
Related in other

Rerandomizable Garbling for Arithmetic Circuits

