The widespread adoption of encrypted communication protocols has significantly enhanced network security and user privacy, simultaneously elevating the importance of encrypted traffic analysis across various domains, including network anomaly detection. The Transport Layer Security (TLS) 1.3 protocol, introduced in 2018, has gained rapid popularity due to its enhanced security features and improved performance. However, TLS 1.3’s security enhancements, such as encrypting more of the handshake process, present unprecedented challenges for encrypted traffic analysis, rendering traditional methods designed for TLS 1.2 and earlier versions ineffective and necessitating the development of novel analytical techniques. This comprehensive survey provides a thorough review of the latest advancements in TLS 1.3 traffic analysis. First, we examine the impact of TLS 1.3’s new features, including Encrypted ClientHello (ECH), 0-RTT session resumption, and Perfect Forward Secrecy (PFS), on existing traffic analysis techniques. We then present a systematic overview of state-of-the-art methods for analyzing TLS 1.3 traffic, encompassing middlebox-based interception, searchable encryption, and machine learning-based approaches. For each method, we provide a critical analysis of its advantages, limitations, and applicable scenarios. Furthermore, we compile and review key datasets utilized in machine learning-based TLS 1.3 traffic analysis research. Finally, we discuss the main challenges and potential future research directions for TLS 1.3 traffic analysis. Given that TLS 1.3 is still in the early stages of widespread deployment, research in this field remains nascent. This survey aims to provide researchers and practitioners with a comprehensive reference, facilitating the development of more effective TLS 1.3 traffic analysis techniques that balance network security requirements with user privacy protection.

Ensuring safety while retaining maximum performance is a basic requirement for automatic cyber-physical systems, especially for safety-critical applications. A quadratic programming optimization framework called MPC-CBF has recently been presented, which directly unifies model predictive control (MPC) with control barrier functions (CBFs) over the prediction time horizon. However, the conservative nature of CBFs can lead to feasibility problems in real applications. Based on the analysis of the role of the decay rate and the conservative accumulation phenomenon in standard CBF formulations, this paper proposes to directly optimize CBF constraints within the MPC framework. By regarding CBFs as a safety restriction level indicator and an optimizable constraint within the MPC framework, the trade-off between feasibility and safety can be adaptively optimized. The proposed Optimizable CBF (OCBF) model removes the hyper-parameters selection problem in standard CBFs and can adaptively adjust the safety restriction level and increase behavior diversity by adding the corresponding objects in the cost function in MPC. To eliminate the accumulation effects of actual values of the CBF constraints in previous time steps, this paper further proposes a General OCBF (GOCBF) formulation. Compared with existing formulations, the safety margin defined in our GOCBF has intuitive physical meanings and thus provides a more flexible and intuitive mechanism to compromise different objects in terms of ensuring safety while not undermining basic feasibility. Experimental results demonstrate that our algorithm provides a more flexible and intuitive mechanism to achieve this, thus improving feasibility and adding behavior diversity in the MPC-CBF framework.

With the continuous development of China's economy and the improvement of residents' living standards, it also brings increasing costs of labor and rent. In addition, the impact of the pandemic on the entity industry has brought opportunities for the development of new retail models. Based on the booming development of artificial intelligence, big data, and mobile payment in the new era, the new retail industry using artificial intelligence technology has shown outstanding performance in the market. Among them, intelligent vending machines have emerged in the new retail model. In order to provide users with a good shopping experience, the product detection speed and accuracy of intelligent vending machines must be high enough. We adopt Faster R-CNN, a mature object detection algorithm in deep learning, to solve the commodity settlement scenario of intelligent vending machines.

Interdisciplinary research promotes the emergence of scientific innovation. Researchers want to find interdisciplinary research in their research field. However, the number of scientific papers published today is increasing, and completing this task by hand is time-consuming and laborious. A neural network is a machine learning model that simulates the connection mode of neurons in the human brain. It is an important application of bionics in the artificial intelligence field. This paper proposes an approach to discovering interdisciplinary research automatically. The method generates an IRD-BERT neural network model for discovering interdisciplinary research based on the pre-trained model BERT. IRD-BERT is used to simulate the domain knowledge of experts, and author keywords can be projected into vector space by this model. According to the keyword distribution in the vector space, keywords with semantic anomalies can be identified. Papers that use these author keywords are likely to be interdisciplinary research. This method is applied to discover interdisciplinary research in the deep learning research field, and its performance is better than that of similar methods.

Cloud storage services bring great convenience to users, but also make data owners lose direct control of their data. How to ensure that deleted cloud data can never be recovered by cloud servers or attackers is a key issue in the field of cloud storage security, which is important to protect user privacy and data confidentiality in the cloud environment. Most existing schemes have the drawbacks of overreliance on key destruction and having the ability to decrypt part of the ciphertext after cracking the key. To solve these problems, a novel cloud data assured deletion scheme based on strong nonseparability is presented. By combining XOR operation with the block cipher, the cipher data become strongly nonseparable; thus, destroying any piece of cipher data will result in unrecoverable original data. Theoretical analysis and experimental results both show that the scheme achieves the expected goals of assured deletion, which has obvious performance advantages and stronger security compared with similar schemes.