Wireless sensor control networks (WSCNs) are important scenarios and trends in mobile wireless sensor networks. Compared with traditional wireless sensor networks, WSCNs have two specific characteristics: entities in networks are extended from passive sensors to active sensors (e.g., actuators and actors) and the transmitting messages are extended from data only to data plus (e.g., data and con...

The Sybil attack is one of the most aggressive and evasive attacks in sensor networks that can affect on many aspects of network functioning. Thus, its efficient detection is of highest importance. In order to resolve this issue, in this work we propose to couple reputation systems with agents based on selforganizing map algorithm trained for detecting outliers in data. The response of the syst...

Given a graph G, a labeling c : V (G) → {1, 2, . . . , d} is said to be d-distinguishing if the only element in Aut(G) that preserves the labels is the identity. The distinguishing number of G, denoted by D(G), is the minimum d such that G has a d-distinguishing labeling. If G2H denotes the Cartesian product of G and H, let G 2 = G2G and G r = G2G r−1 . A graph G is said to be prime with respec...

Time-memory-data (TMD) tradeoff attacks limit the security level of many classical stream ciphers (like E0, A5/1, Trivium, Grain) to 2 n, where n denotes the inner state length of the underlying keystream generator. This implies that to withstand TMD tradeoff attacks, the state size should be at least double the key size. In 2015, Armknecht and Mikhalev introduced a new line of research, which ...

Vertigo is an illusion of rotation due to a disorder of the vestibular system, almost always peripheral. In the history it must be distinguished from pre-syncope, seizures and panic attacks. A single attack of acute, isolated spontaneous vertigo lasting a day or more is due either to vestibular neuritis or cerebellar infarction; distinguishing between the two requires mastery of the head impuls...

We introduce the endomorphism distinguishing number De(G) of a graph G as the least cardinal d such that G has a vertex coloring with d colors that is only preserved by the trivial endomorphism. This generalizes the notion of the distinguishing number D(G) of a graph G, which is defined for automorphisms instead of endomorphisms. As the number of endomorphisms can vastly exceed the number of au...

This letter proposes a threat discrimination methodology for distinguishing between sensor replay attacks and bias faults, based on the specially designed watermark integrated with adaptive estimation. For each type, is changes that imposes system. Threat conditions are rigorously investigated to characterize quantitatively class of faults can be discriminated by proposed scheme. A simulation p...

Since Keccak was selected as SHA-3 hash function by NIST, it has attracted considerable attention from cryptographic researchers. Keccak sponge function [1] has also been used to design message authentication codes (MAC) and authenticated encryption (AE) scheme Keyak. Till now, the most efficient key recovery attacks on Keccak-MAC and Keyak are cube attacks and cube-attack-like cryptanalysis pr...

In this paper, we analyze the security of HMAC and NMAC, both of which are hash-based message authentication codes. We present distinguishing, forgery, and partial key recovery attacks on HMAC and NMAC using collisions of MD4, MD5, SHA-0, and reduced SHA-1. Our results demonstrate that the strength of a cryptographic scheme can be greatly weakened by the insecurity of the underlying hash function.

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a color-preserving permutation of X. In this paper, we show that if G is nilpotent of class c or supersolvable of length c then G always acts with distinguishing number a...