In recent years, Unmanned Aerial Vehicle (UAV) remote sensing has developed rapidly in the field of farmland information monitoring. Real-time and accurate access to farmland information and crop growth dynamics is a prerequisite for the implementation of precision agriculture. Machine Learning identifies existing knowledge to acquire new knowledge, promotes the development of Artificial Intelligence, and brings a large number of data training sets for Machine Learning. The present work aims to ensure the safe operation of agricultural information systems and guarantee the data security of intelligent agriculture. The Machine Learning method explores the wireless network deployment of the UAV system. The geographical location deployment of agricultural information security can effectively carry out rapid security detection of agricultural information security. Firstly, the UAV-assisted information acquisition system was studied. Besides, a Double Deep Q-network (DDQN) algorithm for location deployment based on Geography Position Information (GPI) was proposed to quickly optimize the deployment location of UAVs. GPI can avoid the complicated calculation process of channel state information. The DDQN algorithm was introduced to obtain the functional relationship between GPI and the optimal UAV deployment position, forming a new GPI-Learning strategy. In addition, the Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) are integrated as the CNN-LSTM algorithm to build the intrusion detection system for agricultural IoT for agricultural. In the integrated network structure of the system, LSTM is responsible for data transmission, and CNN is capable of network model building. Combined with the influence of various parameters on the performance of the UAV deployment location algorithm, the simulation experiment set the population size as 36, the discovery probability as 0.25, the step scaling factor as 0.8, and the Levy flight index as 1.25. The network throughput performance of the GPI-Learning algorithm combined with Cuckoo Search was better than other algorithms under different numbers of UAVs. On the KDD-CUP99 data set, the accuracy and detection rate of the agricultural IoT intrusion detection system based on the CNN+LSTM algorithm reached 93.5% and 94.4%, respectively. In general, the agricultural IoT intrusion detection system reported here has crucial practical reference value for the safe operation of agricultural information systems.

Deep Reinforcement Learning (DRL) is an essential subfield of Artificial Intelligence (AI), where agents interact with environments to learn policies for solving complex tasks. In recent years, DRL has achieved remarkable breakthroughs in various tasks, including video games, robotic control, quantitative trading, and autonomous driving. Despite its accomplishments, security and privacy-related issues still prevent us from deploying trustworthy DRL applications. For example, by manipulating the environment, an attacker can influence an agent’s actions, misleading it to behave abnormally. Additionally, an attacker can infer private training data and environmental information by maliciously interacting with DRL models, causing a privacy breach. In this survey, we systematically investigate the recent progress of security and privacy issues in the context of DRL. First, we present a holistic review of security-related attacks within DRL systems from the perspectives of single-agent and multi-agent systems and review privacy-related attacks. Second, we review and classify defense methods used to address security-related challenges, including robust learning, anomaly detection, and game theory approaches. Third, we review and classify privacy-preserving technologies, including encryption, differential privacy, and policy confusion. We conclude the survey by discussing open issues and possible directions for future research in this field.

With the rapid development of Internet of Things (IoT), designing a secure two‐factor authentication scheme for IoT is becoming increasingly demanding. Two‐factor protocols are deployed to achieve a higher security level than single‐factor protocols. Given the resource constraints of IoT devices, other factors such as biometrics are ruled out as additional authentication factors due to their large overhead. Smart cards are also prone to side‐channel attacks. Therefore, historical big data have gained interest recently as a novel authentication factor in IoT. In this paper, we show that existing big data‐based schemes fail to achieve their claimed security properties such as perfect forward secrecy (PFS), key compromise impersonation (KCI) resilience, and server compromise impersonation (SCI) resilience. Assuming a real strong attacker rather than a weak one, we show that previous schemes not only fail to provide KCI and SCI but also do not provide real two‐factor security and revocability and suffer inside attack. Then, we propose our novel scheme which can indeed provide real two‐factor security, PFS, KCI, and inside attack resilience and revocability of the client. Furthermore, our performance analysis shows that our scheme has reduced modular exponentiation operation and multiplication for both the client and the server compared to Liu et al.’s scheme which reduces the execution time by one third for security levels of λ = 128. Moreover, in order to cope with the potential threat of quantum computers, we suggest using lightweight XMSS signature schemes which provide the desired security properties with λ = 128 bit postquantum security. Finally, we prove the security of our proposed scheme formally using both the real‐or‐random model and the ProVerif analysis tool.

Numerical vector aggregation plays a crucial role in privacy-sensitive applications, such as distributed gradient estimation in federated learning and statistical analysis of key-value data. In the context of local differential privacy, this study provides a tight minimax error bound of $O(\frac{ds}{n\epsilon ^{2}})$ , where $d$ represents the dimension of the numerical vector and $s$ denotes the number of non-zero entries. By converting the conditional/unconditional numerical mean estimation problem into a frequency estimation problem, we develop an optimal and efficient mechanism called Collision. In contrast, existing methods exhibit sub-optimal error rates of $O(\frac{d^{2}}{n\epsilon ^{2}})$ or $O(\frac{ds^{2}}{n\epsilon ^{2}})$ . Specifically, for unconditional mean estimation, we leverage the negative correlation between two frequencies in each dimension and propose the CoCo mechanism, which further reduces estimation errors for mean values compared to Collision. Moreover, to surpass the error barrier in local privacy, we examine privacy amplification in the shuffle model for the proposed mechanisms and derive precisely tight amplification bounds. Our experiments validate and compare our mechanisms with existing approaches, demonstrating significant error reductions for frequency estimation and mean estimation on numerical vectors.

As the technical support of the industrial Internet of Things, blockchain technology has been widely used in energy trading, data transactions, and Internet of Vehicles. However, most of the existing energy trading models only address the transaction security and transaction privacy issues that arise in the energy trading process, ignoring the fairness of resource allocation and transaction equity in the trading process. In order to tackle those problems, an energy trading scheme called HO-TRAD is proposed in this paper to improve the efficiency of model trading while ensuring the fairness of energy trading. We propose a new trading strategy in the HO-TRAD energy trading scheme that guarantees fairness in the allocation of trading resources by introducing an entity’s active reputation value. Use smart contracts to achieve transparency and ensure fairness in the transaction process. Based on the identity verification foundation of the consortium chain, the scheme enhances the existing PBFT consensus algorithm and improves the efficiency of model transactions. The experimental simulation indicates that the scheme requires less transaction time and has higher transaction fairness and security.