Paper 2023/564
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
Abstract
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 pairs model, assuming the (sub-exponential) hardness of LWE. Building on this, we show that {\em secure teleportation through quantum channels} is possible. Specifically, given the description of any quantum operation
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Quantum oblivious transferCorrelation-intractabilityTwo-round MPC
- Contact author(s)
-
bartusek james @ gmail com
dakshita @ illinois edu
akshayaram srinivasan @ tifr res in - History
- 2023-04-24: approved
- 2023-04-20: received
- See all versions
- Short URL
- https://ia.cr/2023/564
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/564, author = {James Bartusek and Dakshita Khurana and Akshayaram Srinivasan}, title = {Secure Computation with Shared {EPR} Pairs (Or: How to Teleport in Zero-Knowledge)}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/564}, year = {2023}, url = {https://eprint.iacr.org/2023/564} }