Randomized quantum oblivious transfer with application in hacker-resistant computation

Abstract

OT (Oblivious transfer) is a fundamental primitive in cryptography. But it is well known that in quantum cryptography, unconditionally secure OT is impossible. A variant of OT, i.e. randomized OT, is presented. We then show how to realize this variant in quantum cryptography with some security relaxations, which is inevitable because of the well-known impossible result in quantum cryptography. We also present a new secure computational model, namely HRC (Hacker-Resistant Computation) model. Since on today’s Internet there are more and more hackers and increased cyber threat, knowing how to protect the information and privacy stored on our computer and on cloud servers is very important, even when the computer or server has been breached by hackers. Finally, some interesting applications of the randomized OT variant to HRC are discussed.