Table 1.

Efficiency of [17] and the proposed protocol

	[17]	Ours
Computational complexity	O(n ω 2)	P i:O(ω i),O:O(n ω)
Communication overhead	O(n ω)	P i:O(ω+n),O:O(n ω)
Restriction on set size	|S 1|=…=|S n|	none
Protected values	S i(∀i∈[1,n])	S i,|S i|(∀i∈[1,n])