Edge-assisted quantum protocol for secure multiparty logical AND its applications.

Security and privacy have always been key concerns for individuals in various edge-assisted services. In this paper, we present a feasible quantum solution to an important primitive of secure multiparty computations, i.e.

Privacy-preserving Quantum Sealed-bid Auction Based on Grover's Search Algorithm.

Sealed-bid auction is an important tool in modern economic especially concerned with networks. However, the bidders still lack the privacy protection in previously proposed sealed-bid auction schemes. In this paper, we focus on how to further protect the privacy of the bidders, especially the non-winning bidders.

Secure Multiparty Quantum Computation for Summation and Multiplication.

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively.

Two Quantum Protocols for Oblivious Set-member Decision Problem.

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem.