Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)

ePrint Report: Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)

James Bartusek, Dakshita Khurana, Akshayaram Srinivasan

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, …

access box computation epr eprint report james key knowledge message non power questions report secure computation secure multiparty computation single strings symmetric teleport