A quantum private comparison is a primitive protocol of secure multiparty quantum computation that enables two parties to privately decide whether x = y or not, given two integers x and y , that are held as private inputs by the two parties, respectively. However, many existing quantum private comparison schemes may not be efficient enough, especially applied in big-data and large-scale network environments, because of low efficiency bit-by-bit comparisons. In this paper, we present a novel and efficient quantum private comparison scheme. The proposed scheme provides higher communication efficiency because a secret-by-secret comparison instead of a bit-by-bit comparison is used.A quantum private comparison is a primitive protocol of secure multiparty quantum computation that enables two parties to privately decide whether x = y or not, given two integers x and y , that are held as private inputs by the two parties, respectively. However, many existing quantum private comparison schemes may not be efficient enough, especially applied in big-data and large-scale network environments, because of low efficiency bit-by-bit comparisons. In this paper, we present a novel and efficient quantum private comparison scheme. The proposed scheme provides higher communication efficiency because a secret-by-secret comparison instead of a bit-by-bit comparison is used.

Journal of the Korean Physical SocietyJul 1, 201913 citations

Secure Multiparty Computation

Xun Yi, Xuechao Yang, Xiaoning Liu +5 more

Springer eBooksJan 1, 20259 citations

Secure Multiparty Computation

Keith B. Frikken

Chapman & Hall/CRC applied algorithms and data structures seriesNov 20, 200934 citations

Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs

Maki Yoshida

Non-interactive secure multiparty computation is a method to share and compute a private function $f$ among $n$ parties holding private inputs xi with 1 $n$ in the information theoretical setting. Each party locally computes a message from a share of $f$ and send it to a referee in parallel. The referee obtains the output f (xi,… , xn) while keeping $f$ and xi private other than what can be inferred from the output. The communication complexity is evaluated by the maximum length of shares and messages. In the previous work, several kinds of function families, upper and lower bounds have been improved and the only gaps remaining are for the group products and the Abelian programs (including symmetric functions). This paper improves the communication complexity of both function families towards the optimum by deriving a new lower bound for the group products that matches the previous upper bound (up to a constant factor) and the first asymptotically optimal upper bound for the Abelian programs.Non-interactive secure multiparty computation is a method to share and compute a private function$f$among$n$parties holding private inputs xi with 1$n$in the information theoretical setting. Each party locally computes a message from a share of$f$and send it to a referee in parallel. The referee obtains the output f (xi,… , xn) while keeping$f$and xi private other than what can be inferred from the output. The communication complexity is evaluated by the maximum length of shares and messages. In the previous work, several kinds of function families, upper and lower bounds have been improved and the only gaps remaining are for the group products and the Abelian programs (including symmetric functions). This paper improves the communication complexity of both function families towards the optimum by deriving a new lower bound for the group products that matches the previous upper bound (up to a constant factor) and the first asymptotically optimal upper bound for the Abelian programs.

IEEE International Symposium on Information Theory (ISIT)Jul 7, 20240 citations

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

Runhua Shi, Xia-qin Fang

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., Secure Multiparty Logical AND (SMLA), in which n participants can securely compute logical AND of n private bits. In order to ensure perfect security and achieve good feasibility, we introduce a semi-honest edge server and two non-collusive fog nodes, and design a secure and feasible edge-assisted quantum protocol for SMLA, which cleverly utilizes Secure Multiparty XOR to implement SMLA group by group. Furthermore, we focus on applications of this quantum primitive protocol and design two quantum protocols for Multiple Private Set Intersection and Anonymous One-vote Veto. Compared with classical related protocols, our proposed quantum protocols obtain higher security, which can be guaranteed by the basic principles of quantum mechanics.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., Secure Multiparty Logical AND (SMLA), in which n participants can securely compute logical AND of n private bits. In order to ensure perfect security and achieve good feasibility, we introduce a semi-honest edge server and two non-collusive fog nodes, and design a secure and feasible edge-assisted quantum protocol for SMLA, which cleverly utilizes Secure Multiparty XOR to implement SMLA group by group. Furthermore, we focus on applications of this quantum primitive protocol and design two quantum protocols for Multiple Private Set Intersection and Anonymous One-vote Veto. Compared with classical related protocols, our proposed quantum protocols obtain higher security, which can be guaranteed by the basic principles of quantum mechanics.

iScienceMay 29, 20237 citations

Multiparty Computations

Albrecht Beutelspacher, Klaus-Dieter Wolfenstetter, Jörg Schwenk

Vieweg+Teubner eBooksJan 1, 20100 citations

Non-interactive secure multiparty computation is a method to share and compute a private function

f

among

n

parties holding private inputs xi with 1

n

in the information theoretical setting. Each party locally computes a message from a share of

f

and send it to a referee in parallel. The referee obtains the output f (xi,… , xn) while keeping

f

and xi private other than what can be inferred from the output. The communication complexity is evaluated by the maximum length of shares and messages. In the previous work, several kinds of function families, upper and lower bounds have been improved and the only gaps remaining are for the group products and the Abelian programs (including symmetric functions). This paper improves the communication complexity of both function families towards the optimum by deriving a new lower bound for the group products that matches the previous upper bound (up to a constant factor) and the first asymptotically optimal upper bound for the Abelian programs.