Theoretical Research On Quantum Computation With Blind Feature

Secure multi-party quantum computation(SMQC) which includes blind quantum computation technology, quantum private comparison, quantum anonymous communication, quantum voting and quantum auction, combines quantum information technology with secure multi-party computation(SMC) technology. Because the quantum information technology was introduced in SMQC, it would be improved for security, robustness and efficiency of communication. We focus on the research of quantum private comparison(QPC) and blind quantum computation(BQC).QPC allows two distrustful participants to determine whether they own the same secrets without disclosing any information about their secrets. BQC allows a client who does not have enough quantum resources and technologies to achieve quantum computation on quantum servers which cannot learn anything about Alice’s input, output and algorithm. We propose three quantum computation schemes with blind feature. 1) A ring QPC scheme based on Bell states. The third party(TP) parpares quantum states and computes the comparative results but TP does not know any secret information about two participants. It is operated and realized easily. 2) A two-party QPC scheme based on entanglement swapping. It is more secure and reliable than Liu’s scheme(Commun. Theor. Phys. 2012, 57(4):583-588) and Chen’s scheme(Int. J Theor. Phys. 2014, 53(3):837-840). 3) BQC scheme based on-type entangled states, which-type entangled states as the resource states are prepared. It takes full advantages of blindness of brickwork state to protect Alice’s input, output, and quantum algorithm. After analysis and proof, three schemes are all secure and feasible.