Quantum and classical oblivious transfer: A comparative analysis
Open Access
- 21 May 2021
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Quantum Communication
- Vol. 2 (2) , 42-53
Abstract
Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.Keywords
Funding Information
- European Regional Development Fund (POCI‐01‐0247‐ FEDER‐039728)
- Fundação para a Ciência e a Tecnologia (SFRH/BD/144806/2019, UIDB/50008/2020 ‐ UIDP/50008/2020)
This publication has 48 references indexed in Scilit:
- Private database queries based on counterfactual quantum key distributionPhysical Review A, 2013
- Practical private database queries based on a quantum-key-distribution protocolPhysical Review A, 2011
- Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches2009
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- Quantum Oblivious TransferJournal of Modern Optics, 1994
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978