Oblivious Transfer Is in MiniQCrypt
Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan
Abstract
MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum polynomial-time adversaries, building on the foundational work of Bennett, Brassard, Crépeau and Skubiszewska (CRYPTO 1991). Combining the OT protocol with prior works, we obtain secure two-party and multi-party computation protocols also in MiniQCrypt. This is in contrast to the classical world, where it is widely believed that one-way functions alone do not give us OT. In the common random string model, we achieve a constant-round universally composable (UC) OT protocol.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ff09f17b-345f-4c0d-9f27-1339a9940d2aCited by top-tier papers27
- Cryptography from Pseudorandom Quantum StatesPrabhanjan Ananth, Luowen Qian, Henry YuenCRYPTO 2022 · 78 citations
- Quantum Commitments and Signatures Without One-Way FunctionsTomoyuki Morimae, Takashi YamakawaCRYPTO 2022 · 74 citations
- One-Way Functions Imply Secure Computation in a Quantum WorldJames Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi MaCRYPTO 2021 · 57 citations
- Quantum Cryptography in AlgorithmicaWilliam Kretschmer, Luowen Qian, Makrand Sinha, Avishay TalSTOC 2023 · 47 citations
- Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding UndetectablyAlex Lombardi, Fermi Ma, Nicholas SpoonerFOCS 2022 · 28 citations
Builds on3
- Post-quantum zero knowledge in constant roundsNir Bitansky, Omri ShmueliSTOC 2020 · 47 citations
- Secure Multi-party Quantum Computation with a Dishonest MajorityYfke Dulek, Alex B. Grilo, Stacey Jeffery, Christian Majenz et al.EUROCRYPT 2020 · 41 citations
- Post-Quantum Multi-Party ComputationAmit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana et al.EUROCRYPT 2021 · 21 citations
Related papers
- On the Round Complexity of Secure Quantum ComputationJames Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi MaCRYPTO 2021 · 24 citations
- Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-RoundNai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi YamakawaCRYPTO 2022 · 8 citations
- A New Approach to Post-Quantum Non-MalleabilityXiao Liang, Omkant Pandey, Takashi YamakawaFOCS 2023 · 6 citations
- The Round Complexity of Black-Box Post-quantum Secure ComputationRohit Chatterjee, Xiao Liang, Omkant Pandey, Takashi YamakawaCRYPTO 2025 · 1 citation
- Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)James Bartusek, Dakshita Khurana, Akshayaram SrinivasanCRYPTO 2023 · 3 citations
