Performance of Practical Quantum Oblivious Key Distribution
Mariano Lemus (Instituto de Telecomunicações)
Peter Schiansky (University of Vienna)
Manuel Goulão (INESC-ID, Okinawa Institute of Science and Technology Graduate University)
Mathieu Bozzio (University of Vienna)
David Elkouss (Okinawa Institute of Science and Technology Graduate University, TU Delft - Electrical Engineering, Mathematics and Computer Science, TU Delft - Communication QuTech)
Nikola Paunković (Universidade Técnica de Lisboa, Instituto de Telecomunicações)
Paulo Mateus (Instituto de Telecomunicações, Universidade Técnica de Lisboa)
Philip Walther (University of Vienna)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Motivated by the applications of secure multi-party computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum oblivious transfer. By using only symmetric cryptography primitives to implement commitments, we construct computationally secure randomized oblivious transfer without the need for public-key cryptography or assumptions imposing limitations on the adversarial devices. We show that the protocol is secure under an indistinguishability-based notion of security and demonstrate an experimental implementation to test its real-world performance. Its security and performance are then compared to both quantum and classical alternatives, showing potential advantages over existing solutions based on the noisy storage model and public-key cryptography.
help_outline