Computationally Secure Quantum Oblivious Transfer
Authors:
- 19 November 2021
- journal article
- research article
- Published by Wiley in Advanced Quantum Technologies
- Vol. 5 (1) , 2100125
Abstract
Oblivious transfer (OT) is one of the cornerstones of secure multiparty computation. It is clear that unconditionally secure OT is impossible. Any protocol for OT requires computational assumptions, such as number‐theoretic cryptographic assumptions or the assumptions of existence of one‐way functions. On the other hand, it is broadly believed that one‐way functions alone do not promise secure OT. However, in this paper, a novel computationally secure quantum oblivious transfer (QOT) protocol is proposed with the help of quantum channels under the minimum assumption requirements: the existence of one‐way functions.Keywords
Funding Information
- National Natural Science Foundation of China (61872245)
This publication has 16 references indexed in Scilit:
- Oblivious Transfer Based on Physical Unclonable Functions2010
- Efficient-phase-encoding protocols for continuous-variable quantum key distribution using coherent states and postselectionPhysical Review A, 2006
- Oblivious transfer using quantum entanglementPhysical Review A, 2006
- 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
- Experimental quantum cryptographyJournal of Cryptology, 1992
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- Equivalence Between Two Flavours of Oblivious Transfers1988
- A randomized protocol for signing contractsCommunications of the ACM, 1985