SearcharxivSearch

arXiv subjects

Na Song

Publications and source records attributed to Na Song.

2 recordsLinked to original sources

PRISE: Privacy-pReserving Image Searchable Encryption Scheme for Intelligent Vehicle Systems

With the continuous advancement of intelligent vehicle technology, the image data generated by vehicles has become increasingly critical in various applications, including driver assistance, traffic monitoring, and safety warning systems. However, this growing reliance on image data also raises pressing concerns regarding its security and privacy protection. Searchable encryption technology, as an effective means to protect data security, shows significant potential for application in the field of intelligent vehicles. In this paper, we propose a novel Privacy-pReserving Image Searchable Encryption Scheme (PRISE) to address the security and privacy challenges associated with image data in intelligent vehicles. The PRISE scheme employs Multilinear Principal Component Analysis (MPCA) to extract data features and integrates symmetric encryption and matrix encryption techniques to ensure image privacy protection. To enhance search efficiency, we utilize a Mahalanobis distance-based fuzzy C-means (FCM) clustering method, which accelerates the search process on the cloud server. We conducted comprehensive experiments to evaluate our proposed scheme, and the results were consistent with our analytical findings, confirming the security of our approach. Comparative experiments with existing schemes demonstrated that our proposed method achieves higher accuracy while maintaining a comparable query time.

cs.CR

GraphTorque: Torque-Driven Rewiring Graph Neural Network

Graph Neural Networks (GNNs) have emerged as powerful tools for learning from graph-structured data, leveraging message passing to diffuse information and update node representations. However, most efforts have suggested that native interactions encoded in the graph may not be friendly for this process, motivating the development of graph rewiring methods. In this work, we propose a torque-driven hierarchical rewiring strategy, inspired by the notion of torque in classical mechanics, dynamically modulating message passing to improve representation learning in heterophilous and homophilous graphs. Specifically, we define the torque by treating the feature distance as a lever arm vector and the neighbor feature as a force vector weighted by the homophily disparity between nodes. We use the metric to hierarchically reconfigure receptive field of each layer by judiciously pruning high-torque edges and adding low-torque links, suppressing the impact of irrelevant information and boosting pertinent signals during message passing. Extensive evaluations on benchmark datasets show that the proposed approach surpasses state-of-the-art rewiring methods on both heterophilous and homophilous graphs.

cs.LG