1-Shot Oblivious Transfer and 2-Party Computation from Noisy Quantum Storage

2024-10-10

arXiv.org

AI Summary

Non-interactive oblivious transfer (OT) and one-round secure two-party computation (2PC) are impossible in classical models without strong assumptions such as trusted hardware, quantum random oracles (QROM), or pre-shared entanglement. Method: This work constructs the first unconditionally secure, two-message non-interactive OT, one-time programs (OTPs), and one-time memories (OTMs) in the noisy quantum storage (NQS) model—relying solely on its physical limitations. We integrate quantum error-correcting codes, one-time functions, and Yao-style garbled circuit compilation, assuming only semi-honest adversaries. Contribution/Results: Our protocols achieve true round optimality—one round for both OT and general 2PC—breaking the long-standing round-complexity lower bound. They are the first unconditionally secure, non-interactive OT and universal 2PC schemes in a physically plausible quantum model. This establishes a new paradigm for post-quantum cryptography and lightweight secure computation, eliminating reliance on idealized cryptographic primitives while preserving information-theoretic security.

Technology Category

Machine Learning: Quantum Machine LearningSearch and Optimization: Non-convex OptimizationNatural Language Processing: Safety and Robustness

Application Category

Security and Privacy: Applications of cryptographyEconomics, Online Markets and Human Computation: LLM based quality controls for crowd workResponsible Web: Data and user privacy-enhancing technologies for the Web

Abstract

Few primitives are as intertwined with the foundations of cryptography as Oblivious Transfer (OT). Not surprisingly, with the advent of the use of quantum resources in information processing, OT played a central role in establishing new possibilities (and defining impossibilities) pertaining to the use of these novel assets. A major research path is minimizing the required assumptions to achieve OT, and studying their consequences. Regarding its computation, it is impossible to construct unconditionally-secure OT without extra assumptions; and, regarding communication complexity, achieving 1-shot (and even non-interactive) OT has proved to be an elusive task, widely known to be impossible classically. Moreover, this has strong consequencesfor realizing round-optimal secure computation, in particular 1-shot 2-Party Computation (2PC). In this work, three main contributions are evidenced by leveraging quantum resources: 1. Unconditionally-secure 2-message non-interactive OT protocol constructed in the Noisy-Quantum-Storage Model. 2. 1-shot OT in the Noisy-Quantum-Storage Model -- proving that this construction is possible assuming the existence of one-way functions and sequential functions. 3. 1-shot 2PC protocol compiled from a semi-honest 1-shot OT to semi-honest 1-shot Yao's Garbled Circuits protocol.

Problem

• Achieve non-interactive Oblivious Transfer using quantum resources
• Implement one-shot OT/One-Time Memory with everlasting security
• Construct One-Time Programs without hardware or QROM

Innovation

• Non-interactive OT using noisy quantum storage
• One-shot OTM with everlasting security
• Hardware-free One-Time Programs via OTM