Table 2 Theoretical performance comparison
From: Enabling efficient traceable and revocable time-based data sharing in smart city
Scheme | Encrypt | Decrypt | KeyGen |
|---|---|---|---|
Scheme [12] | \((2|X| + |{\mathrm{TP}}| + 1)E_0\) \(+ (|{\mathrm{TP}}| + 1)E_1\) \(+ M_1 + |{\mathrm{TP}}|P\) | \((|X| + K)E_1 +\) \((2|X| + K + 2)M_1\) \(+ (2|X| + 1)P\) | \((3|S|+1)E_0\) \(+ |S|M_0\) |
Our scheme | \(N((2|X|+d+|{\mathrm{TP}}|\) \(+2)E_0+(|{\mathrm{TP}}|+1)E_1\) \(+ M_1+|{\mathrm{TP}}|P)\) | \(E_1 + M_1\) | \((4|S| + 3|P|)E_0\) \(+ (|S| + 2|P|)M_0\) |
Scheme | PP size | DSK size | CT size |
Scheme [12] | \(3|G_0|+|G_1|\) | \((2|S|+1)|G_0|\) | \((2|X|+|{\mathrm{TP}}|+1)|G_0|\) \(+ |G_1| + |{\mathrm{TP}}||Z_p|\) |
Our scheme | \((d+2)|G_0| + |G_1|\) | \(|Z_p|\) | \(|N|((2|X|+|{\mathrm{TP}}|+3)|G_0|\) \(+ |G_1| + |{\mathrm{TP}}||Z_p|)\) |