Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). (arXiv:2304.10480v1 [quant-ph])

Can a sender non-interactively transmit one of two strings to a receiver
without knowing which string was received? Does there exist
minimally-interactive secure multiparty computation that only makes (black-box)
use of symmetric-key primitives? We provide affirmative answers to these
questions in a model where parties have access to shared EPR pairs, thus
demonstrating the cryptographic power of this resource.

First, we construct a one-shot (i.e., single message) string oblivious
transfer (OT) protocol with random receiver bit in the shared EPR …

access box computation epr key knowledge message non oblivious power protocol questions random secure computation secure multiparty computation single strings symmetric teleport