Search

The emergence of IoT has introduced new security concerns, particularly the detection of large-scale network attacks initiated by compromised IoT devices. The diverse nature of IoT devices adds complexity to attack detection, necessitating the classification of devices based on their unique characteristics and behavior patterns. This paper presents a novel device classification method grounded in traffic differentials before and after IoT devices succumb to compromise. The study defines the concept of attack sensitivity and designs a method for calculating the value. The K-means algorithm is used to classify devices into predefined categories based on their attack sensitivity values. The effectiveness of this method is demonstrated through experiments on a public dataset. Additionally, a multi-class classification model is developed to identify newly added devices to the IoT environment, with good results in accuracy, precision, recall, F1 score, and FPR (0.999, 0.997–1,0.997–1,0.998–1,0–0.001). Overall, The device classification method proposed in this paper, based on attack sensitivity, not only enables a rational definition of device categories but also ensures precise classification for devices newly integrated into the IoT environment. This lays the foundation for achieving more precise attack detection and protection, advancing the field towards enhanced cybersecurity measures. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) devices produce a humongous amount of data frequently stored on cloud servers, and as a result, cryptographic techniques to guarantee the privacy of outsourced data while preserving search ability on servers are becoming indispensable research topics. A prominent example of such topics is the concept of public key authenticated encryption with keyword search (PAEKS). In spite of the large number of PAEKS schemes in the literature, most existing schemes exhibit issues in certificate management, key escrow, or even key distribution. To address these issues, recently, PAEKS schemes in the certificate-based setting have gained attention. To the best of our knowledge, there exist only two Certificate-Based Authenticated Encryption with Keyword Search (CBAEKS) schemes, both presented with rather weak security models based on single keyword challenges. In this paper, we propose an enhanced security model for CBAEKS which captures notions of multi-ciphertext and multi-trapdoor indistinguishability, then proceed to devise a concrete instantiation for a CBAEKS scheme and formally prove its security under our enhanced model. Furthermore, we prove that the existing CBAEKS schemes are insecure under the enhanced security model. Comparisons with related schemes in the literature are also provided to demonstrate that the enhanced security is achieved at some affordable costs. [ABSTRACT FROM AUTHOR]