QUANT-PHCRNov 26, 2020

One-Way Functions Imply Secure Computation in a Quantum World

arXiv:2011.13486v365 citations
AI Analysis

This work addresses the foundational problem of secure multi-party computation in a quantum setting, providing a theoretical construction for quantum cryptographers.

This paper demonstrates that quantum-hard one-way functions can be used to construct simulation-secure quantum oblivious transfer (QOT). This QOT is sufficient for secure computation of arbitrary quantum functionalities.

We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities. Furthermore, our construction only makes black-box use of the quantum-hard one-way function. Our primary technical contribution is a construction of extractable and equivocal quantum bit commitments based on the black-box use of quantum-hard one-way functions in the standard model. Instantiating the Crépeau-Kilian (FOCS 1988) framework with these commitments yields simulation-secure QOT.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes