EURASIP Journal on Information Security

Table 2 Communication and computational complexity for SP, H _m and user i for one iteration of the algorithm

From: Privacy-preserving distributed clustering

	Our proposal			Algorithm in[9]
	SP	H _m	User	SP	User
Encryption	$O (N_{u} R)$	$O (N_{g} K)$	$O (1)$	$O (N_{u} K (R + ℓ))$	$O (K (R + ℓ))$
Decryption	-	$O (N_{g} R)$	-	$O (N_{u} K (R + ℓ))$	-
Multiplication	$O (N_{u} R)$	-	$O (R)$	$O (N_{u} KR)$	$O (K (R + ℓ^{2}))$
Exponentiation	$O (N_{u} K)$	-	$O (R)$	-	$O (K (R + ℓ^{2}))$
Communication	$O (N_{u} (R + K))$	$O (N_{g} (R + K))$	$O (R)$	$O (N_{u} K (R + ℓ))$	$O (K (R + ℓ))$

In terms of Paillier encryptions. SP, service provider, H_m, helper user.

Back to article page