Efficient Anonymous Data Authentication for Vehicular Ad Hoc Networks

Table 2

Functional and computational comparisons of the proposed approach with existing ABS techniques, i.e., Yu et al.’s algorithm [16], Cui et al.’s algorithm [17], and Xiong et al.’s algorithm [36].

Scheme	Policy	Traceability	Revocability	Computational cost
Yu et al.’s algorithm [16]		No	No
Cui et al.’s algorithm [17]		Yes	Yes
Xiong et al.’s algorithm [36]	LSSS	No	Yes
Proposed without batch		Yes	Yes
Proposed batch verification

¹In this example, we use the number of operations to represent the encryption overhead of IoT devices. denotes the bilinear mapping operation . and represent the exponential operation in group and , respectively, and and stand for the multiplicative operation in and . ² denotes the size of the whole set of attributes in the system. is the number of attributes involved in an access structure (an access tree or matrix), and stands for the number of users in the ABE systems. denotes the average number of vehicles equipped with an attribute.