Yong Zeng

• Xidian University

Currently, the performance of machine learning-based encrypted traffic recognition models is always unsatisfactory on imbalanced datasets. Existing methods neglected the time series features in the traffic. To solve this problem, this paper proposes TimeGAN, an encrypted traffic time series feature generation model based on dilated convolutional ne...

Facial recognition technology has been developed and widely used for decades. However, it has also made privacy concerns and researchers’ expectations for facial recognition privacy-preserving technologies. To provide privacy, detailed or semantic contents in face images should be obfuscated. However, face recognition algorithms have to be tailor-d...

In Internet-of-vehicles, vehicles cooperate with each other by transmitting Internet-of-vehicles and location-based service (LBS) providers optimize services by analyzing trajectory data collected from drivers. Nevertheless, illegal trajectories generated by attackers or malicious drivers can obfuscate the process of analysis and breach the quality...

It is crucial to generate random graphs with specific structural properties from real graphs, which could anonymize graphs or generate targeted graph data sets. The state-of-the-art method called spectral graph forge (SGF) was proposed at INFOCOM 2018. This method uses a low-rank approximation of the matrix by throwing away some spectrums, which pr...

The characteristics of social networks has always been a hot topic of scientific research. In order to protect the privacy of users, the owner of the private data need to provide privacy protection when providing inquiries or publishing data. Local differential privacy (LDP) is difficult to construct a highly available social networks graph due to...

Covert communication can prevent an adversary from knowing that a transmission has occurred between two users. In this article, we consider covert wireless communications in an Internet-of-Things (IoT) network with dense deployment, where an IoT device experiences not only the background noise but also the aggregates interference from other Tx devi...

Covert communication can prevent an adversary from knowing that a wireless transmission has occurred. In additive white Gaussian noise (AWGN) channels, a square root law is found that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ channel uses. In this paper, we consider covert communications in noisy wireless n...

Covert wireless communication or low probability of detection (LPD) communication that employs the noise or jamming signals as the cover to hide user's information can prevent a warden Willie from discovering user's transmission attempts. Previous work on this problem has typically assumed that the warden is static and has only one antenna, often n...

Wireless channels are increasingly being used to transmit highly sensitive information in the Internet of Things. However, traditional cryptography methods cannot solve all security problems in IoT systems. Covert wireless communication can prevent an adversary from knowing the existence of a user's transmission; thus, it can provide stronger secur...

Covert wireless communication can prevent an adversary from knowing the existence of user's transmission, thus provide stronger security protection. In AWGN channels, a square root law was obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in n channel uses in the presence of a passive ea...

Covert communication can prevent the opponent from knowing that a wireless communication has occurred. In the additive white Gaussian noise channels, if we only take the ambient noise into account, a square root law was obtained and the result shows that Alice can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ channel use...

Noise is a powerful resource for the implementation of cryptographic primitives, especially in wireless networks. In general, a key agreement protocol is tailored to the channels and relies on the assumption that knowledge on the eavesdropper’s channel is available. This is not practical. In this paper, we focus on the problem of developing key agr...

This paper presents a framework to analyze the controllability of opinion dynamics in social networks using DeGroot model (DeGroot, 1974). We show how the opinion, or attitude about some common questions of interest in a population can be controlled by a committed node who consistently proselytizes the opposing opinion and is immune to influence. S...

Code dissemination is very useful to remotely fix bugs or add now functions in wireless sensor networks (WSNs) after sensors deployed. Hostile environments keep the secure code dissemination a major concern. The Delugebased protocols are the widely used code disseminations, however, which have to take much energy and memory to deal with the problem...

Recent researches about the fault and intrusion tolerance of the complex networks take the topology or functions of the networks as benchmark. This paper shows a novel framework of the fault and intrusion tolerance of complex networks in a controllability view, which takes the number of driver nodes as standard. The result, the SF networks have a b...

Suppose that n nodes with n 0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at most r, the acquaintanceship between nodes forms a random graph, while the physical communicati...

In this paper, we propose an object-oriented attack model to represent a protocol attack in WSN detailedly. The model describes multiple attributes of an attack, including its principle, impact, interdependent relationships with other attacks, etc. Then, on the basis of the attack model and the FSM description method, we present a security testing...

Security protocols for wireless sensor network are designed to provide a variety of security services to secure communications in an unsafe network. It is demanded to verify whether an implementation of a security protocol indeed perform as described in the protocol. In practice, conformance testing is commonly employed to test whether an implement...

Because of enormous complexity of security protocols and lack of efficient security protocol modeling method, how to evaluate the WLAN security protocols poses unique and formidable challenges. To address this issue, a universal and extensible simulation platform for WLAN security protocols is proposed. First, the architecture of the platform is pr...

Multicast routing is very important for wireless sensor and actor networks (WSANs), where the decisions or control information from actors will be delivered to sensors over each link of the WSANs only once. In the multicast route each copy should be securely send to the authenticated destinations. The relay nodes should compute and identify forward...

The three-party password-based key exchange protocols using Weil pairing proposed by Wen is vulnerable to impersonation attack. By introducing hard artificial intelligence problem, we show an improved protocol, which can resist against not only the impersonation attack but also all the other well-known attacks. Analysis also shows that improved pro...

This paper present a novel packet delivery mechanism only using local information for probabilistic non-dominated guarantee of high data confidentiality and reliability in wireless sensor networks. In the data confidentiality domain, a secret message is transformed into multiple shares by secret sharing schemes and then forwarding towards destinati...

Cryptographically strong sequences should have a large 2-adic complexity to thwart the known feedback with carry shift register synthesis algorithms. At the same time the change of a few terms should not cause a significant decrease of the 2-adic complexity, that is, the k-error 2-adic complexity should also be large. Recent developments in stream...

Designing reliability differentiated services for missions with different reliability requirements has become a hot topic in wireless sensor networks. Combined with a location-based routing mechanism, a quantified model without full network topology is proposed to evaluate reliability. By introducing a virtual reference point, the data transfer is...

DRM (digital rights management) has no well-known standards about encryption algorithms. This paper proposes a novel FCSR (Feedback with Carry Shift Registers) based keystrem cipher generator for DRM. The novel generator has passed the NIST statistical test, which shows the pseudo-random properties of the novel keystream generator are ideal. We sim...

This short paper presents practical algorithms for mitigating inefficiency in reliability differentiation service based on geographical stateless routing, which has great potential applications in large scale wireless sensor networks (WSN). Based on available algorithm, the paper presents a mathematical formalization to systematic understanding the...

Cryptographically strong sequences should have a large N-adic complexity to thwart the known feedback with carry shift register (FCSR) synthesis algorithms. At the same time the change of a few terms should not cause a significant decrease of the N-adic complexity. This requirement leads to the concept of the k-error N-adic complexity. In this pape...

Given an m-sequence, the main factor influencing the least period of the Generalized Self-Shrinking (GSS) sequence is the selection of the linear combining vector G. Based on the calculation of the minimal polynomial of L GSS sequences and the comparison of their degrees, an algorithm for selecting the linear combining vector G is presented, which...

Real-Time intrusion detection system (IDS) based on traffic analysis is one of the highlighted topics of network security researches. Restricted by computer resources, real-time IDS is computationally infeasible to deal with gigantic operations of data storage and analyzing in real world. As a result, the sampling measurement technique in a high-s...

The stability of the linear complexity of the generalized self-shrinking sequences over GF(2) with period N=2 n− − 1 is investigated. The main results follow: The linear complexity of the periodic sequences obtained by either deleting or inserting one symbol within one period are discussed, and the explicit values for the linear complexity are give...

A family of novel pseudorandom number generators is proposed based on an evolutionary algorithm. These pseudorandom number generators are expressed as EAPRNG. EAPRNGs are driven by some existed simple and unsafe generators which are denoted by mother generators (MG), while outputs of the MGs are hidden by EAPRNGs. The analysis indicates that EAPRNG...

A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the problem. To enhance the algorithm, two new genetic operators are specifically designed, which can avoid producing infeasible solutions. In addition, two...