An attempt at universal quantum secure multi-party computation with graph state

Abstract

Quantum secure multi-party computation (SMC) is a vital field in quantum cryptography. In this paper, we try to resolve SMC problems universally via graph states. Firstly, three kinds of quantum SMC protocols are investigated, which are quantum private comparison protocol, quantum millionaire protocol and quantum multi-party summation protocol. Secondly, three proposed protocols are reviewed, and then the core of them is summarized. We further find that the computation, deduced as modulo subtraction, can be resolved by using graph state. This implies that our protocols are universal in part and will be widely applicable. Thirdly, analyses show that the proposed protocols are correct and secure. Our research will promote the development of quantum secure multi-party computation.