Abstract-Although a large number of pairing-based key-agreement cryptosystems have been proposed, there are still a lot of drawbacks. One of the most important disadvantages of mentioned cryptographic functions is that there is not a comprehensive system to satisfy both security and efficiency requirements. Moreover, there is not an integrated document to categorize and present possible challenges. Therefore, we paid particular attention to this issue, unlike other surveys in the area of key-agreement cryptosystems. In this paper, we presented a new method to address possible challenges. Actually, we claim that unlike existing documents, this paper determines possible challenges and open problems in the area of lightweight pairing-based key-agreement cryptosystems. We expect that our findings make other researchers able to classify all presented cryptosystems in this area and help them to follow the best way to solve possible problems in the future researches.Index Terms-Key-agreement, lightweight, pairing-based.

No abstract

In today’s world, the main challenge is to save use energy optimally. The IoT devices generate a large amount of data for wide applications. Considering the application perspective in the IoT market, in one instance of the IoT technology, that is a wireless sensor network, factors like energy, storage capacity, computation power, and limitations of communication bandwidth resources are the reason for using data fusion. Data fusion and aggregation in wireless sensor networks (WSNs) such that minimum energy is consumed are an essential issue. In most clustering models, data aggregation is carried out by the cluster-head (CH). In the proposed algorithm, data aggregation in the cluster-head is carried out using the lossless cascode Huffman compression algorithm. Due to the correlation among data of nodes, the data sensed by each node is compared with the data of the cluster-head node; after removing redundancy, the coded data is transmitted to the main node. The CH node is selected by an algorithm based on fuzzy logic according to the residual energy of the node and the distance of the node from the sink node. Various fuzzy type-I systems of Mamdani and Takagi-Sugeno and type-II systems are used. In this paper, the CH selection algorithms are evaluated using three scenarios in terms of the number of live nodes, received packets and CHs, proper distribution rate, and other parameters of the LEACH protocol, network lifetime, and network energy. In the following, to demonstrate the performance of this new algorithm, simulations are performed in MATLAB based on the proposed method. The results show that the proposed compression algorithm in environments with high data correlation improves the compression rate by 8% compared to the conventional Huffman compression, while in environments with low data correlation, these two algorithms perform almost the same. This compression helps reduce the energy consumption of the network.