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, 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 secure teleportation through quantum channels is possible. Specifically, given the description of any quantum operation Q, a sender with (quantum) input ρ can send a single classical message that securely transmits Q(ρ) to a receiver. That is, we realize an ideal quantum channel that takes input ρ from the sender and provably delivers Q(ρ) to the receiver without revealing any other information. This immediately gives a number of applications in the shared EPR pairs model: (1) noninteractive secure computation of unidirectional classical randomized functionalities, (2) NIZK for QMA from standard (sub-exponential) hardness assumptions, and (3) a noninteractive zero-knowledge state synthesis protocol.
• Next, we construct a two-round (round-optimal) secure multiparty computation protocol for classical functionalities in the shared EPR pairs model that is unconditionally-secure in the (quantum-accessible) random oracle model.
Classically, both of these results cannot be obtained without some form of correlated randomness shared between the parties, and the only known approach is to have a trusted dealer set up random (string) OT correlations. In the quantum world, we show that shared EPR pairs (which are simple and can be deterministically generated) are sufficient. At the heart of our work are novel techniques for making use of entangling operations to generate string OT correlations, and for instantiating the Fiat-Shamir transform using correlation-intractability in the quantum setting.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Quantum One-Time Programs, RevisitedAparna Gupte, Jiahui Liu, Justin Raizes, Bhaskar Roberts 等STOC 2025 · 被引用 2 次
- A New Approach to Arguments of Quantum KnowledgeJames Bartusek, Ruta Jawale, Justin Raizes, Kabir TomerCRYPTO 2026
它引用的顶会 Paper19
- Cryptography from Pseudorandom Quantum StatesPrabhanjan Ananth, Luowen Qian, Henry YuenCRYPTO 2022 · 被引用 78 次
- Hidden Cosets and Applications to Unclonable CryptographyAndrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark ZhandryCRYPTO 2021 · 被引用 64 次
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWERuta Jawale, Yael Tauman Kalai, Dakshita Khurana, Rachel Yun ZhangSTOC 2021 · 被引用 61 次
- Non-interactive Batch Arguments for NP from Standard AssumptionsArka Rai Choudhuri, Abhishek Jain, Zhengzhong JinCRYPTO 2021 · 被引用 57 次
- One-Way Functions Imply Secure Computation in a Quantum WorldJames Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi MaCRYPTO 2021 · 被引用 57 次
相关 Paper
- On the Round Complexity of Secure Quantum ComputationJames Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi MaCRYPTO 2021 · 被引用 24 次
- Oblivious Transfer Is in MiniQCryptAlex B. Grilo, Huijia Lin, Fang Song, Vinod VaikuntanathanEUROCRYPT 2021 · 被引用 56 次
- Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-RoundNai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi YamakawaCRYPTO 2022 · 被引用 8 次
- Round-Optimal Black-Box MPC in the Plain ModelYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram SrinivasanCRYPTO 2023 · 被引用 7 次
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CCS 2019 · 被引用 238 次
