VerSA

The advent of the internet of things (IoT) and augmented reality technology not only introduces a wide range of security risks and challenges but also increases traffic on the existing wireless communication networks. This is due to the enormity of the traffics generated by the connected IoT devices whose number keeps increasing. Therefore, any IoT network requires an effective security solution capable of securing data and minimizing traffic on the IoT networks. To address these, the authors propose a practicable secure data aggregation scheme, VerSA, based on data grouping aggregation, batch verification through the aggregated signature ratios, and symmetric encryption with a pairing free key distribution. The scheme is capable of grouping and aggregating sub-network data into homogeneous and heterogeneous groups, detecting and filtering injected false data. The results show that the proposed scheme is not only secure against IoT related attacks but also has the lowest computational and communication overheads compared to the recent state-of-the-art schemes.

An Efficient Pairing-free Batch Verification Scheme for VANET

An intelligent traffic system, which can flexibly allocate traffic resources, serves as a good assistant to help us improve traffic safety and efficiency of controlling traffic volume, providing instant traffic information and giving priority to ambulances. Although such system is powerful, it could be misused without prop er protection. For example, malicious drivers might forge the message of the ambulance so that they can quickly pass through intersections. In addition, because traffic information is huge and needs to be processed immediately, traditional schemes that pro cess the information one by one are not competent. For this issue, a lot of batch schemes have been proposed. Most of them adopt the algorithm of Bilinear pairing while the others tries to avoid it since pairing operations are complex. However, such pairin g - free schemes are not applicable because their calculation time will explode when there are more data waiting to be processed. In this article, we briefly describe those schemes and propose a more effective one to solve the problems mentioned above.

An Identity-Based Cross-Domain Authenticated Asymmetric Group Key Agreement

Cross-domain authenticated asymmetric group key agreement allows group members in different domains to establish a secure group communication channel and the senders can be anyone. However, the existing schemes do not meet the requirement of batch verification in the group key negotiation phase, which makes the schemes have low efficiency. To address this problem, an identity-based cross-domain authenticated asymmetric group key agreement is proposed that supports batch verification. The performance analysis shows that this protocol is highly efficient. Finally, the proposed protocol is proved to be secure under the k-Bilinear Diffie–Hellman Exponent assumption.

Efficient Anonymous Data Authentication for Vehicular Ad Hoc Networks

Vehicular ad hoc network (VANET) encounters a critical challenge of efficiently and securely authenticating massive on-road data while preserving the anonymity and traceability of vehicles. This paper designs a new anonymous authentication approach by using an attribute-based signature. Each vehicle is defined by using a set of attributes, and each message is signed with multiple attributes, enabling the anonymity of vehicles. First, a batch verification algorithm is developed to accelerate the verification processes of a massive volume of messages in large-scale VANETs. Second, replicate messages captured by different vehicles and signed under different sets of attributes can be dereplicated with the traceability of all the signers preserved. Third, the malicious vehicles forging data can be traced from their signatures and revoked from attribute groups. The security aspects of the proposed approach are also analyzed by proving the anonymity of vehicles and the unforgeability of signatures. The efficiency of the proposed approach is numerically verified, as compared to the state of the art.