A New 1-out-of-k Quantum Oblivious Transfer Protocol

With the development of quantum computing,the appearance of quantum computer becomes possible.Research on the cryptosystem which can resist the attack of quantum computer becomes a hot issue about cryptography.Oblivious Transfer(OT)protocol is a very useful cryptographic primitive with important application,such as secure multiparty computation,authentication protocols and so on.The OT protocol can protect the privacy of both communicating parties and is a communication protocol that delivers messages in an ambiguous form.In 1981,Michael O.Rabin proposed the oblivious transfer protocol in order to establish a secret communication scheme.Later,in order to apply to secure multi-parties computation,S.Even,O.Goldreich and A.Lempel proposed a new OT protocol,namely 1-out-of-2 OT protocol.One of two mutually distrustful parties(Alice)transmits 2 messages in such a way that the other party(Bob)can choose one of message he has recieved but cannot obtain information about he other message,and Alice will be entirely ignorant of the message Bob received.In order to apply to the general situation,people promoted the original protocol to 1-out-of-k OT protocol.In 1992,Charles Bennett and Gilles Brassard et al.proposed a quantum 1-out-of-2 OT protocol which is based on BB84 protocol.This scheme transmits 1-bit messages and cannot resists malicious receiver attacks,such as delayed mea-surement attacks.In this dissertation,we extend the quantum 1-out-of-2 OT protocol which is proposed by Charles Bennett and Gilles Brassard et al.and describe a new quan-tum 1-out-of-k OT protocol.Our protocol has two advantages.Firstly,it can resist the attack of malicious receiver and resist the attack of delay measuremen-t.Secondly,our protocol can send messages of any length.And our protocol security is based on the fundamental principles of quantum mechanics.In order to ensure that the protocol can resist the attack of the malicious receiver,we add a commit protocol to resist the quantum attack.In order to transmit n-bit messages correctly,we introduce the universal hash function.In order to resist other attacks by the malicious receiver,we limit the number of elements in the protocol that the receiver can divide the set into subsets.