In resource-constrained, low-cost, radio-frequency identification (RFID) sensor–based mobile ad hoc networks (MANETs), ensuring security without performance degradation is a major challenge. This paper introduces a novel combination of steps in lightweight protocol integration to provide a secure network for RFID sensor–based MANETs using error-correcting codes (ECCs). The proposed scheme chooses a quasi-cyclic ECC. Key pairs are generated using the ECC for establishing a secure message communication. Probability analysis shows that code-based identification; key generation; and authentication and trust management schemes protect the network from Sybil, eclipse, and de-synchronization attacks. A lightweight model for the proposed sequence of steps is designed and analyzed using an Alloy analyzer. Results show that selection processes with ten nodes and five subgroup controllers identify attacks in only a few milliseconds. Margrave policy analysis shows that there is no conflict among the roles of network members.
Radio-frequency identification (RFID) devices, with the help of tags and reader devices, are used for object identification and any subsequent tracking and record management. Wireless sensor nodes have sensing, ad hoc, wireless, and multi-hops communication capabilities. Security in RFID sensor–based mobile ad hoc networks (MANETs) demands that we discuss the following issues:
▪ Areas: routing, data forwarding, link layer, and so on.
▪ Attacks: external versus internal, passive versus active, and so on.
▪ Defense mechanisms: confidentiality, integrity, and so on.
▪ Challenges: lightweight, decentralization, fault tolerant, and so on.
▪ Protocols: symmetric key cryptography, digital signature, and so on.
▪ Applications: disaster recovery, public safety, and so on.
Various RFID and sensor-node integration mechanisms have been proposed [1]–[3]. These scenarios help to construct MANETs when RFID devices are attached with mobile sensor devices [4]. The mobile sensor devices are then able to sense nearby objects from which to collect necessary information. For example, a MANET may consist of RFID readers attached with sensors to help route information and construct ad hoc networks, or it may consist of tags attached with sensor nodes that communicate among themselves to construct ad hoc networks, and so on [2]. Such integration and construction has many advantages. For example, it increases the range of availability of information for animal, person, or object counting; record management of large datasets; observations of insurgence activities during military exercises; sensing of human body activities in healthcare environments; and so on. However, this integration carries with it many network security threats, such as jamming, spoofing, tracking, flooding, physical attacks, and so on. Both RFID and sensor devices are resource-constrained devices; thus, they require lightweight or ultra-lightweight cryptography.This paper extends the virtual node–based hierarchy construction found in [5] and [6]. First, an extension of the creation of multiple hierarchies is made, in which each subgroup consists of a fixed number of mobile sensor nodes. The nodes are then divided into subgroups, hierarchies, and networks to reduce the funneling effect [7]. Identification marks to these nodes are assigned using compact ECCs. Second, under the extension, the locations of the mobile sensor nodes are observed for the establishment and maintenance of the relationship policies using trust management. These policies are analyzed and verified against conflicts of interest using a Margrave policy analysis [8]–[9]. A lightweight model of the proposed scheme is constructed and analyzed using an Alloy analyzer [10]–[12].The rest of this paper is organized as follows. Related work to lightweight cryptography, identification protocols using ECC, authentication protocols, and grouping protocols with distance bounding, as well as a discussion on the possibilities of attacks, is given in Section II. Section III states the definitions, symbols, and notations used in this work. A novel identification, authentication, group-distance bounding, ownership transfer mechanism–based integrated approach is presented in Section IV. In Section V, the proposed mechanism is checked through probability-based fault acceptance rate analysis for Sybil, eclipse, and desynchronization attacks. Section VI shows the lightweight modeling, primitives, and policy analysis. Finally, conclusions are drawn in Section VII.
II. Background
- 1. Lightweight Cryptography
Lightweight cryptography can be classified into primitives and protocols. The goal of lightweight primitives is to achieve confidentiality, integrity, authentication, availability, and non-repudiation [6]. Lightweight primitives can be classified as being either symmetric or asymmetric. Lightweight protocols can be classified into the following: identification, authentication, distance bounding, grouping proof, and tag ownership transfer. After assigning identifications to nodes, communication between nodes occurs over an insecure channel; thus, there is a need for strong mechanisms to secretly exchange information over the channel. In such cases, authentication protocols are designed to fill this need. Network services are administrated through local and global subgroup constructions so as to save energy consumption. This goal is achieved through distance-bounding and group-yoking protocols. The process of joining and leaving nodes for right management, tag transfer, or updating some secret information is achieved through tag and ownership transfer protocols. The development of these protocols over recent years is discussed in the next subsection.
- 2. Identification Protocols Using ECCs
In code-based identification systems, the McEliece-based cryptosystem is the first public-key linear ECC–based cryptosystem using Goppa codes, and it is NP complete [13]. This scheme has fast encryption and decryption functions and is efficient for resource-constrained embedded devices [14]. The major problem of this scheme is its large key size [15]. Various schemes have been proposed to reduce the key size using different coding techniques. The Sidelnikov system with Reed-Muller codes is an example of a reduced key length code–based cryptosystem. However, this system is prone to structural attacks [16]. The Janwa–Moreno system with algebraic geometric codes was broken by Faure and Minder for codes on curves of genus g ≤ 2 [17]. The Gabidulin–Paramonov–Tretjakov system with Gabidulin codes also proposed a reduced key length cryptosystem. The aforementioned systems are affected by trap door and structural attacks, such as Gibson’s attack, Ourivski’s attack, and polynomial time attacks [18]–[19]. The Niederreiter system with generalized Reed–Solomon codes is also designed for identification. But, this system does not work properly with matrix arithmetic operations [20]. Berger and others proposed a reduced key generation process using Reed–Solomon codes in quasi-cyclic form [15]. This coding mechanism is selected in this paper to generate random codes and to assign identification marks for the current work.
- 3. Authentication Protocols
Authentication through location verification was initially proposed by Sastry and others [21]. This time-based location verification approach requires extra hardware to verify locations. Capkun and others also proposed an on-the-spot verification algorithm that again requires extra hardware [22]. To remove the cost of such extra hardware, various lightweight techniques have been proposed [23]. Techniques that do not require extra hardware are classified as: trust score–based techniques [24], distance-based techniques [25], or probabilistic approaches [26]. These techniques are affected with basic logic malfunctioning attacks [27]. In 2012, Tian and others proposed a permutation-based authentication protocol to avoid attacks due to unbalanced OR and AND operations by using permutations [26]. Permutation-based protocols are prone to desynchronization, traceability, and disclosure attacks. However, attempts have been made to modify RFID authentication protocols with permutation protocols to avoid desynchronization attacks [27].
- 4. Grouping Protocols
In 2004, Juels was the first to propose the idea of generating evidence for the presence of a group of nodes [28]. Juels’ idea of grouping is for un-trusted users and was proposed to provide verifiable proofs [28]–[29]. Lamport extended this idea into two mechanisms: basic construction and one based on Lamport digital signature construction [29]. However, this idea of grouping is prone to replay attacks, denial of service, and impersonation attacks. Saito and Sakurai, in 2005, proposed a timestamp-based grouping scheme [30]. This idea was to remove Juels’ replay attack. However, Piramuthu found that the extended approach was, indeed, not protected from replay attacks [31]. In 2007, Cho and others proposed a new mechanism to protect a group of nodes from replay attacks [32]. In their scheme, increased complexity made it difficult for an attacker to instigate a replay attack. In 2010, Lee and others proposed an ECC-based yoking protocol [33]. In this scheme, computations on tags are simpler and more efficient than in other schemes. Recently, another lightweight authentication protocol that takes into consideration anonymity, authentication, and untraceability was designed by Chien [34]. This system is based on ECCs and a public key–based Rabin cryptosystem.
- 5. Attacks
Dynamic topology, an open medium, distributed nodes, fluctuating link capacity, limited energy, scarcity of resources, and so on make a system vulnerable to attacks. External and internal attackers impersonate the identities and privileges of other nodes so as to disturb a network. Sybil, eclipse, and desynchronization are examples of such control traffic attacks and are described as follows:
▪Sybil attack. In this type of attack, a malicious node behaves as a legitimate node by impersonating or stealing the identity of a node. This attack is possible through methods such as direct communication, indirect communication, fabricated or stolen identities, and so on. This attack cannot be prevented completely until the attacker has enough resources to create the Sybils. In the wider literature, various methods to limit this type of attack have been proposed. These methods can be classified based on the following parameters:• Strong identification of peers[35]• Authentication and authorization[36]• Trust score[37]
▪Eclipse attack. In a network, many versions of this attack are possible. This attack does not directly disrupt the network, but it does boost other attacks. In this attack, an attacker tries to capture neighboring nodes that can be easily compromised. Malicious nodes conspire to mislead correct nodes to control traffic. This enables flooding, denial of service, or censorship attacks. Mechanisms to defend against this kind of attack are classified into the following two major categories[38]–[39]:• Structural constraints• Proximity constraints
▪ Desynchronization attack.An attacker can break the synchronization between reader and tag to use different identity pseudonyms. Different identity pseudonyms between reader and tag result in a desynchronization attack[40]. In[41], a desynchronization attack is analyzed over a hash-based mutual authentication scheme. This work states that a desynchronization attack can be avoided by adding additional messages to acknowledge the identity pseudonyms. However, Deursen and Radomirovic analyzed that sending an acknowledge packet does not prevent such an attack[42].
III. Preliminaries
- 1. Definitions
Definition 1 (Lightweight memory-less sensor source). Let us denote a given mobile sensor node by MN. Let MN follow a particular path SP = s_{1}, s_{2}, … , s_{p}, where s_{a} is an independent random state such that 1 ≤ a ≤ p for p ε ℤ^{+}. Then, the probability that MN follows a particular state s_{a} is given by P(MN follows s_{a}) = MN_{sa}. This probability is independent of previous or future states, but a hidden Markov chain can be used to relate the states and their respective probabilities. It is assumed to be memory-less because the path followed is independent of any stored route. Further, it is based on key distribution, authentication, availability, or any other cryptographic primitive.
- 2. Symbols and Notation
Let
MN (i,j) (k,n)
represent the ith mobile sensor node (MN) of the jth subgroup (SG) in the kth hierarchical layer (HL) of the nth network (NW). Here, i∈{1, 2, , W_{MN}}, j∈{1, 2, … , X_{SG}}, k∈{1, 2, … , Y_{HL}}, and n∈{1, 2, … , Z_{NW}}, where W_{MN} is the maximum number of mobile nodes in each subgroup, X_{SG} is the maximum number of subgroups among all hierarchical layers, Y_{HL} is the highest hierarchical layer, and Z_{NW} is the maximum number of networks constructed. Let F_{q} denote a finite field (F) with primitive element G and prime q. Suppose E_{K}(m) and D_{K}(m) are the encryption and decryption of message m using key K, respectively. Let RSSI, A_{TS}, and
Q( MN (i,j) (k,n) )
represent the reserved signal strength indicator (RSSI), the average trust score of an application or mobile node, and entropy of
MN (i,j) (k,n)
, respectively.
IV. Proposed Methodology
Nodes in the proposed work are divided into subgroups, groups, and hierarchies. Figure 1 shows the construction of a single hierarchy. Each subgroup consists of a fixed number of mobile nodes. These mobile nodes may be in the form of real nodes or virtual programmable nodes. Real nodes are existing nodes, and virtual nodes are programmable nodes; this allows us to construct subgroups that are in the same vicinity as each other to save energy [5].
An increase in W_{MN}, X_{SG}, Y_{HL}, or Z_{NW} will lead to an increase in the traffic intensity, network overhead, delays, collisions, congestion, packet loss, and power consumption. This would then result in a decrease in throughput [7]. We now outline the steps necessary to construct a secure hierarchy.
- 1. Unique Number Generation Using Compact Codes
Berger and others used the process of key generation using Reed–Solomon codes in quasi-cyclic form to generate identification numbers with reduced key length [15]. This process is extended in this work to generate keys for distributing identification marks using a lightweight code–based identification protocol. In F_{q}, a tuple [TU = 1, T, … , T^{g−1}] is selected, where T = (G)^{(qI−1)×g}. Here, g is the order of T, and I is a random number belonging to the set {0, 1, … , q}. If d is the hamming distance in binary codes and V is the block parity-check matrix, then a Reed–Solomon code in quasi-cyclic form can be represented by M_{2I} = (V_{0}|V_{1}⋯|V_{(qI−1)−1}), and V_{d} can be calculated as$${\text{\bm{V}}}_{d}=\left(\begin{array}{c}1\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}1\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\cdots \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}1\\ {G}^{d}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}{G}^{d}T\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\cdots \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}{G}^{d}{T}^{\U0001d628-1}\\ {({G}^{d})}^{2I-1}{({G}^{d}T)}^{2I-1}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\cdots \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}{({G}^{d}{T}^{\U0001d628-1})}^{2I-1}\end{array}\right).$$
- 2. Key Generation Using Reduced Key Length with Compact Codes
The McEliece system, based on Reed–Solomon codes, with its compact public key generation and reduced communication is selected for this work [13]. This is an integrated and modified form of the protocol proposed by Berger and others [15]. This simple and efficient code-based process encrypts the data at a much higher rate and generates private and public keys with reduced key length and improved security. Thus, the algorithm is suitable for low-cost devices. According to this algorithm, a public key (PU_{i}) and private key (PR_{i}) for the ith mobile node is given by PU_{i} = (H, I) and PR_{i} = (d, G, SP, G_{α}), respectively, where
H=( B 1 ′ | ... | B ( q I −1 ) ′ ).
Here,
B i ′
is the identity code in binary form, d ∈ (0,1,2,…,[(q^{I}−1)−1]) is the hamming distance, and
G α ∈( G α 1 , G α 2 , ... , G α ( q I −1) )
is the random primitive element with order smaller than g in the αth iteration of assigning identification marks, discussed in Algorithm 1. According to Definition 1, SP is a random path.
- 3. Identification Marks to Nodes Using Compact Code Identification Protocols
After generating codes and a key pair, identification marks to nodes are assigned using Algorithm 1. The approach of Aguilar and others of the double-circulant protocol (DCP) for zero-knowledge code-based identification with reduced communication is modified with an encryption/decryption process [43].Algorithm 1. Identification assignment using DCP with Reed–Solomon codes in quasi-cyclic form. Goal. Assigning unique identifiers with reduced communication. Premises. Let R_{q} and N_{q}∈F_{q} be the random numbers, S^{α}∈{1, 2, … , q} is the node’s shift operation random number, and t^{α}∈{0,1) is the random number selected by the destination node in αth iteration of assigning the identifier. Suppose J^{Gα} represents the permutation of a randomly selected code from M_{2I} and h is a lightweight hash. Step 1. Source computes two commitments: ${w}_{1}=h({J}^{{G}_{\alpha}^{1}}({R}_{\alpha})\text{}\mathrm{...}\text{}h({J}^{{G}_{\alpha}^{\left({q}^{I}-1\right)}}\text{(}{R}_{\alpha})\text{)and}{w}_{2}=h({J}^{{G}_{\alpha}^{1}}({R}_{\alpha}\text{|G)}\mathrm{...}\text{}h({J}^{{G}_{\alpha}^{\left({q}^{m}-1\right)}}({R}_{\alpha}\text{|G)})$ for each node and send it to respective node. Also, ${E}_{P{R}_{i}}({J}^{{G}_{\alpha}^{i}}({\text{M}}_{2I}))$ and ${E}_{P{R}_{i}}({R}_{\alpha}\text{|}{J}^{{G}_{\alpha}^{i}}({\text{M}}_{2I}))$ are sent to destination. Step 2. Each destination node sends S^{α} to source. Step 3. ith mobile node source makes S^{α} bits rotation, ${e}_{i}=({\text{ROTATION}}_{{(S)}^{\alpha}}({\text{M}}_{2I}^{\alpha})$ and sends commitment ${w}_{3}=h({J}^{{G}_{\alpha}^{1}}({R}_{\alpha}\text{|}G)+{e}_{i})\text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}h({J}^{{G}_{\alpha}^{({q}^{I}-1)}}(({R}_{\alpha}\text{|}G)+{e}_{i}))$ to destination nodes. Step 4. Next, each destination node sends t^{α} to source. Step 5. If t^{α} = 0 then source reveals D_{PRi}(R_{α} + N_{α}) and ${J}^{{G}_{\alpha}^{1}}\mathrm{...}\text{\hspace{0.17em}\hspace{0.17em}}{J}^{{G}_{\alpha}^{({q}^{I}-1)}}$ else if t^{α} = 1 then source reveals ${D}_{P{R}_{i}}\text{}({J}^{{G}_{\alpha}^{1}}({R}_{\alpha}\text{\hspace{0.05em}|\hspace{0.05em}}G)\text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}$${J}^{{G}_{\alpha}^{({q}^{I}-1)}}\text{}({R}_{\alpha}\text{\hspace{0.05em}|\hspace{0.05em}}G))$and ${D}_{P{R}_{i}}\text{}({J}^{{G}_{\alpha}^{1}}({e}_{1})\text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\text{}({e}_{i}))$. Step 6. Finally, if destination node has sent t^{α} = 0 then it will verify w_{1} and w_{3} else it will verify w_{2} and w_{3}.
- 4. Collecting Proofs and Locations of Mobile Nodes
The presence of
MN (i,j) (k,n)
at some specific location in a random state
s a ( x a , y a )
is identified using Frisbee constructions [44]. The Frisbee process constructs circular overlapping zones to cover a simulation area using an RSSI [45]. The probability of following a particular path through states
s 1 ( x 1 , y 1 )
to
s p ( x p , y p )
is calculated from a Markov chain trajectory. This forms the following state/location matrix:$$\begin{array}{l}\text{LOC}=\left\{\begin{array}{c}{\left(\langle {s}_{1}^{({x}_{1},{y}_{1})}\text{|}{s}_{2}^{({x}_{2},{y}_{2})}\cdots \text{|\hspace{0.17em}\hspace{0.17em}}{s}_{p}^{({x}_{p},{y}_{p})}\rangle \right)}_{1},\\ {\left(\langle {s}_{1}^{({x}_{1},{y}_{1})}\text{|}{s}_{2}^{({x}_{2},{y}_{2})}\cdots \text{|}{s}_{p}^{({x}_{p},{y}_{p})}\rangle \right)}_{2},\\ \vdots \\ {\left(\langle {s}_{1}^{({x}_{1},{y}_{1})}\text{|}{s}_{2}^{({x}_{2},{y}_{2})}\cdots \text{|}{s}_{p}^{({x}_{p},{y}_{p})}\rangle \right)}_{{X}_{\text{SG}}}\end{array}\right\}\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}=\{{v}^{1},{v}^{2},\text{\hspace{0.17em}\hspace{0.17em}}\cdots \text{\hspace{0.17em}\hspace{0.17em}},{v}^{p}\}.\end{array}$$Here, v^{i} is the probability of the ith node following a particular path. Location verification is confirmed through nodes’ trust scores. The next step explains the trust management procedure to find the trust scores of mobile nodes so as to verify their locations.
- 5. Determine Trust Score of Each Mobile Node from its Activities
Trust reflects a node’s consistent honesty. Trust management includes trust generation, trust propagation, trust accumulation, and trust application. These elements of trust management are processed through many cycles so as to update trust values at regular intervals. Initially, all nodes are considered to be pure souls; thus, they have complete trust. The trust management steps followed in this work are as follows.Trust generation. The trust of a mobile node is calculated from a health score. In this work, a health score is calculated from the energy state of a mobile node, the probability of sending positive signals, and the capacity of a node to receive, transmit, or route traffic. Lightweight energy measurement does not require any new hardware and is achieved instantaneously. Now, energy = power × time. An RSSI unit provides the value of “power,” and “time” is calculated as the number of bits transmitted divided by the transmission rate. The probability of sending positive signals is measured using connectivity with neighboring nodes, since neighboring nodes know the behavior of the observing node. So, if two nodes were neighbors and had exchanged data, then a positive signal is sent toward the subgroup controller; otherwise, a negative signal is sent. For each node, a subgroup controller calculates the total positive and negative count for every node. The capacity of a node to receive, transmit, or route traffic is measured using QoS parameters, such as goodput, delivery ratio, delay, jitter, coverage, and so on. The three aforementioned factors relating to health score are rated on a scale of 1 (lowest) to 10 (highest) by a subgroup controller. This value of health is directly proportionate to a node’s trust level. A subgroup controller then broadcasts this trust score to respective mobile nodes using lightweight encryption.Trust propagation. During trajectory, each node needs to produce its trust value. A binary trust score for each node will be of the sequence {0, 1}*. On coming to a particular state, it will produce a trust value. Thus, the average trust score (A_{TS}) will consist of two factors: the probability that it will come to a specific state (MN_{sa}) and the length of a sequence of assigned identification binary bits (L_{seq}), as generated by a memory-less sensor source. The average trust score A_{TS} is calculated as
A TS ( MN (i,j) (k,n) )= ∑ a=1 p MN s a × L seq
. To generate the optimized value of A_{TS}, the compact L_{seq} should satisfy the bounds
Q( MN (i,j) (k,n) )/log c ≤ L seq ≤ Q( MN (i,j) (k,n) )/log c+1
, where c is the length of the trust score produced by
MN (i,j) (k,n)
. Entropy is strongly dependent on the probability of following a particular path. Lesser states indicate less uncertainty. As can be seen from Fig. 2, let us consider the movement of a mobile node from the first subgroup at the kth layer to the jth subgroup at the (k + 1)th layer. The states of nodes nearest to the origin will be of a higher probability than those that are away from the origin. As shown in Fig. 2, the probability of a mobile node moving to either of the positions 1, 2, 3, 4, 5, or 6 is higher than that of it moving to either 7, 8, 9, 10, or 11. In addition, the probability of node 1 will be higher than that of any other neighboring nodes because the direction of the jth subgroup at the (k + 1)th layer can be determined from key generation or the distribution mechanism. Let the probabilities of the paths to be followed (paths 7–11) be 0.9, 0.7, 0.5, 0.25, and 0.1, respectively; and if a source emits a single-bit binary compact code, then A_{TS}= 2.45. Similarly, the A_{TS} scores for 2, 3, 4, 5, 6, and so on can be calculated to be 4.9, 7.35, 9.8, 12.25, 14.7, and so on, respectively.
Trust accumulation. Now, every node is producing its trust score. Hence, the accumulation of a source’s trust score is strongly dependent on the reliability of its path. Thus, we can say that
A TS ( MN (i,j) (k,n) )
strongly reflects a path’s trust worthiness. Now, a receiver needs to make a decision rule to interpret the original stream with certain probability. Let
B( MN (i,j) (k,n) )
be the binary code produced and assigned to
MN (i,j) (k,n)
. The receiver decision rule is a trust function and can be represented as follows:$$b:\left\{{A}_{\text{TS}}^{{s}_{1}^{({x}_{1},{y}_{1})}}\left(B\left(M{N}_{\left(i,j\right)}^{\left(k,n\right)}\right)\right)|\dots |{A}_{\text{TS}}^{{s}_{p}^{({x}_{p},{y}_{p})}}\left(B\left(M{N}_{\left(i,j\right)}^{\left(k,n\right)}\right)\right)\right\}.$$Using the decision rule function b, the receiver will produce an output stream. The selection of code as well as decision by the receiver is based upon the trust score of the path followed. The most trusted path will be preferred. During transmission of trust, strong identification protects the system from various attacks, such as: Sybil, eclipse, collusion, routing, and storage attacks.Trust application. Many applications are interested in providing services to a network. Each service provided by an application linked to
MN (i,j) (k,n)
will have a trust score. This trust score is compared with
A TS ( MN (i,j) (k,n) )
. If
A TS ( MN (i,j) (k,n) )
is higher, then access is granted for the provision of service.
V. Attack Analysis
- 1. Sybil Attack
A probability-based analysis of the proposed system attempts to seek out a mistake that could result in a Sybil attack. A mistake is an alteration of a message or code during transmission. Assume that the probability of a change during transmission is 1–π and that the probability of no change is π. Let, FASA represents the fault acceptance in the case of a Sybil attack. Let FACF describes the fault acceptance when commitments (that is, w_{1}, w_{2}, and w_{3}) are not verified while assigning unique identifications. Let FALV describe the fault acceptance in the case when challenges from/to an outlier (
O (h,j) (k,n)
) are not verified. Let
PT MN (i,j) (k,n)
represent the probability of successful protection from a Sybil attack if the trust score of
MN (i,j) (k,n)
is higher than a given threshold. Let NBRC represents that no bit is received during commitment verification in an identification assignment protocol. Let z_{Seq} represent the length of a bit sequence not received during trust propagation, L_{Seq} ≥ z_{Seq}. Let
NC MN (i,j) (k,n)
represents that no collision will occur for
MN (i,j) (k,n)
during its distance verification and mutual authentication.Now, we have$$\begin{array}{l}P\left[\text{FASA}\right]=P\left[\text{FASA}\cap \text{FACF}\cap \text{FALV}\right]\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}=P\left[\text{FASA}\right]\times P\left[\text{FACF}/\text{FASA}\right]\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\times P\left[\text{FALV}/\text{FASA}\right]\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\times P[\text{FACF}/\text{FASA}/\text{FALV}].\end{array}$$$$\begin{array}{l}P[\text{FASA}]=[1-{\left(1-\text{\pi}\right)}^{{L}_{\text{Seq}}}]\times {\text{PT}}_{{\text{MN}}_{\left(i,j\right)}^{\left(k,n\right)}}\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\approx \left[1-{\left(\frac{1}{2}\right)}^{{L}_{\text{Seq}}}\right]\times {\text{PT}}_{{\text{MN}}_{(i,j)}^{(k,n)}}.\end{array}$$Now, the probability of fault acceptance can be calculated as$$\begin{array}{l}P\left[\text{FACF}/\text{FASA}\right]=P\left[\text{NBRC}\right]\times {\text{PT}}_{{\text{MN}}_{\left(i,j\right)}^{\left(k,n\right)}}\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}=\text{}\left[1-{\left(\frac{1}{2}\right)}^{{z}_{\text{Seq}}}\right]\times {\text{PT}}_{{\text{MN}}_{\left(i,j\right)}^{\left(k,n\right)}}.\end{array}$$$$P\left[\text{FALV}/\text{FASA}\right]=P[{\text{NC}}_{{\text{MN}}_{\left(i,j\right)}^{\left(k,n\right)}}]\times {\text{PT}}_{{\text{MN}}_{\left(i,j\right)}^{\left(k,n\right)}}.$$$$\begin{array}{l}P\left[\text{FACF}/\text{FASA}/\text{FALV}\right]\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}=1-{\left(\frac{1}{2}\right)}^{{L}_{\text{Seq}}}\times \left[1+{\left(\frac{1}{2}\right)}^{{z}_{\text{Seq}}}\right]\times {\text{PT}}_{{\text{MN}}_{\left(i,j\right)}^{\left(k,n\right)}}.\end{array}$$By putting (2), (3), (4), and (5) into (1), it can be estimated that P[FASA] is very high (≈ 0.9). Thus, the proposed system provides significant protection against Sybil attacks.
- 2. Eclipse Attack
The proposed system is protected from an eclipse attack because a strong identification mechanism is used to provide unique identifications to nodes. If there is a large delay in the mechanism, then this signals that there are untrusted nodes present. Trust is a fruitful component in this network to maintain relationships among nodes, which in turn reduces the chances of such an attack happening. An eclipse attack is possible if an attacker tries to insert a node to capture a single node (or group of nodes) with an identification mark that has not yet been assigned to a node. The chances of this type of attack happening can be calculated using the birthday paradox.If U combinations of L_{Seq} are possible, then P[FAEA] =
( 1− [ U U ] × [ U−1 U ] × [ U−2 U ] × ⋯ × [ 1 U ] ) × PTEA MN (i,j) (k,n) ,
where FAEA represents the fault acceptance in an eclipse attack and
PTEA MN (i,j) (k,n)
represents the probability of successful protection from an eclipse attack if and only if the trust score of
MN (i,j) (k,n)
is higher than a certain threshold. Thus, the number of nodes in each subgroup does not have to exceed ten to make the system stronger against an eclipse attack. Now, if the number of nodes in each subgroup is less than ten, then P[FAEA] ≥ 0.8.
- 3. Desynchronization Attack
The proposed scheme is lightweight because hashing is used at source side; that is, reader side only. Let FADA represent the fault acceptance against a desynchronization attack. Now, we have$$\begin{array}{l}P\left[\text{FADA}\right]=\text{\hspace{0.17em}}P\left[\text{FADA}\cap \text{FACF}\cap \text{FALV}\right]\\ \text{}=\text{\hspace{0.17em}}P\left[\text{FADA}\right]\times P\left[\text{FACF}/\text{FASA}\right]\\ \text{\hspace{0.05em}}\times P\left[\text{FALV\hspace{0.05em}}/\text{\hspace{0.05em}FASA}\right]\text{\hspace{0.17em}}\times \text{\hspace{0.17em}}P\left[\text{FACF\hspace{0.05em}}/\text{\hspace{0.05em}FADA\hspace{0.05em}}/\text{\hspace{0.05em}FALV}\right].\end{array}$$However, it has been analyzed in the literature that the blocking verification process increases the chances of a desynchronization attack. Therefore, if w_{1} or w_{2} is not verified, then P[FACF/FASA] = P[FALV/FASA] = P[(FACF/FADA)/ FALV]≈1. If step 1 and step 2 of Algorithm 1 are verified properly, then the probability of fault acceptance at step 3 is comparatively less, but still acceptable. Here, the number of rotations for the fixed length G is constant. Let ℓ_{DA} represent the number of combinations for L_{DA} bits of G. For each unique value of 2^{LDA}, we have$$\begin{array}{l}P\left[\text{FADA}\right]\text{\hspace{0.17em}}=\text{\hspace{0.17em}}1\text{\hspace{0.17em}}-\text{\hspace{0.17em}}\{\left[\frac{{2}^{{L}_{\text{DA}}}}{{2}^{{L}_{\text{DA}}}}\right]\times \left[\frac{\left({2}^{{L}_{\text{DA}}}\text{}-1\right)}{{2}^{{L}_{\text{DA}}}}\right]\text{\hspace{0.17em}}\times \text{\hspace{0.17em}\hspace{0.17em}}\dots \\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\times \left[\frac{{2}^{{L}_{\text{DA}}}\text{}\times \text{\hspace{0.17em}}{\ell}_{\text{DA}}\text{}+\text{\hspace{0.17em}}1}{{2}^{{L}_{\text{DA}}}}\right]\}.\end{array}$$The probability of fault acceptance increases with an increase in L_{DA} bits. Even at a lesser bit length (that is, three bits), it provides a higher fault acceptance probability (≈ 0.3). The probability of fault acceptance at step 5 of Algorithm 1 can be calculated as$$\begin{array}{l}P\text{}\left[\text{FADA}\right]\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}=P(\text{Change\hspace{0.17em}\hspace{0.17em}in\hspace{0.17em}\hspace{0.17em}}\left({J}^{{G}_{\alpha}^{1}}({R}_{\alpha}\text{|}G)\text{\hspace{0.17em}}\mathrm{...}\text{\hspace{0.17em}}{J}^{{G}_{\alpha}^{({q}^{I}-1)}}({R}_{\alpha}\text{|}G)\right)\text{||}\\ \text{Change\hspace{0.17em}\hspace{0.17em}in\hspace{0.17em}\hspace{0.17em}}\left({J}^{{G}_{\alpha}^{1}}({e}_{i})\text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}{J}^{{G}_{\alpha}^{({q}^{I}-1)}}({e}_{i})\right)\end{array}$$$$\begin{array}{l}\left\{\begin{array}{l}\left\{1-\left[\frac{{2}^{{J}^{{G}_{\alpha}^{1}}\left({R}_{\alpha}\text{|}G\right)}}{{2}^{{J}^{{G}_{\alpha}^{1}}\left({R}_{\alpha}\text{|}G\right)}}\right]\times \left[\frac{{2}^{{J}^{{G}_{\alpha}^{1}}\left({R}_{\alpha}\text{|}G\right)}-1}{{2}^{{J}^{{G}_{\alpha}^{1}}\left({R}_{\alpha}\text{|}G\right)}}\right]\times \text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}\times \left[\frac{1}{{2}^{{J}^{{G}_{\alpha}^{1}}\left({R}_{\alpha}\text{|}G\right)}}\right]\right\}\times \text{\hspace{0.17em}\hspace{0.17em}}\dots \\ \times \left\{\left[\frac{{2}^{{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\left({R}_{\alpha}\text{|}G\right)}}{{2}^{{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\left({R}_{\alpha}\text{|}G\right)}}\right]\times \text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}\times \text{\hspace{0.17em}}\left[1-\left(\frac{1}{{2}^{{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\left({R}_{\alpha}\text{|}G\right)}}\right)\right]\right\}\end{array}\right\}\left|\right|\\ \left\{\begin{array}{l}\left\{1-\left[\frac{{2}^{{J}^{{G}_{\alpha}^{1}}\left({e}_{1}\right)}}{{2}^{{J}^{{G}_{\alpha}^{1}}\left({e}_{1}\right)}}\right]\times \left[\frac{{2}^{{J}^{{G}_{\alpha}^{1}}\left({e}_{1}\right)}-1}{{2}^{{J}^{{G}_{\alpha}^{1}}\left({e}_{1}\right)}}\right]\times \text{\hspace{0.17em}\hspace{0.17em}}\dots \text{\hspace{0.17em}\hspace{0.17em}}\times \left[\frac{1}{{2}^{{J}^{{G}_{\alpha}^{1}}\left({e}_{1}\right)}}\right]\right\}\times \text{\hspace{0.17em}\hspace{0.17em}}\dots \\ \times \left\{\left[\frac{{2}^{{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\left({e}_{i}\right)}}{{2}^{{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\left({e}_{i}\right)}}\right]\times \dots \times \left[1-\left(\frac{1}{{2}^{{J}^{{G}_{\alpha}^{({q}^{I}-1)}}\left({e}_{i}\right)}}\right)\right]\right\}\end{array}\right\}.\end{array}$$The complexity of the system increases with an increase in the number of bits during rotation or permutation combinations. This increase in bits enhances the fault acceptance probability of a de-synchronization attack.
VI. Lightweight Analysis
- 1. Lightweight Design Analysis
In this section, the proposed protocol is modeled and analyzed using Alloy [10]–[12]. Figure 3 shows an example of an Alloy model used to construct a group in the proposed protocol. In this example model, five nodes form part of a network with a single identity code and a key pair generator. Each node in the network will request the generation of a unique identification. However, identifications shall be assigned to member nodes only. Table 1 shows the delay calculations for such identification generation and key pair generation. Various observations from an analysis of the Alloy model can be seen. These are as follows:
▪ If each subgroup contains less than 10 member nodes, then it is possible to construct a network with limited delay.
▪ If the number of member nodes increases from ten to eleven in each subgroup, then a minimum of 170% increase in delay is observed. This brings us to the conclusion that if the number of member nodes in each subgroup is ten, then it is considered to be the best possible solution.
▪ With an increase in the number of networks, there is an increase in delay, but the delay begins to decrease if the number of nodes in each subgroup is ten.
Delay calculations in identification and key pair generation.
No. of networks
No. of randomly positioned nodes and members in each network
Time (ms)
1
5/10/11/15/20
62/842/1513/18690/INF
5
5/10/11/15/20
156/1,652/2,823/27,949/INF
10
5/10/11/15/20
141/1,266/2,732/INF/INF
20
5/10/11/15/20
156/843/2,934/INF/INF
After subgroup formation, the process of selecting a subgroup controller begins. Figure 4 shows an example of the selecting of a subgroup controller in one network. Five processes are programmed to select a subgroup controller in a network. As shown in Fig. 4, a hierarchical network is constructed. Processes, using both the hierarchical structure and the identification marks of nodes, exchange tokens to select a controller. Every node in this hierarchy is controlled by its parent node. Node 6 and node 8 have a bidirectional link because both are primary subgroups in the upper-most layer. Table 2 shows the delay calculations when five or ten processes are run to select a subgroup controller. The results show that if five processes are selected to elect a subgroup controller, then there is less delay compared to when ten processes are selected. The delay increases with an increase in the number of nodes, networks, or processes. However, if there are more than ten networks, ten nodes, and ten processes, then it is not feasible to select a subgroup controller within a limited time period. Thus, if the number of networks or nodes increases, then a five processes–based subgroup controller election is preferred.
Delay calculations in selecting a subgroup controller.
No. of networks
No. of randomly positioned nodes
No. of processes to select a subgroup controller
Time (ms)
1
10/15/20
5
936/1,950/6,630
1
10/15/20
10
3,456/7,925/INF
5
10/15/20
5
1,232/4,134/6,303
5
10/15/20
10
46,005/50,086/28,139
10
10/15/20
5
1,310/1,794/3,998
10
10/15/20
10
INF/INF/INF
20
10/15/20
5
1,373/2,824/2,402
20
10/15/20
10
INF/INF/INF
Figure 5 shows a prototype model of the remaining components in the proposed methodology. In this example, five nodes have location coordinates (x_{a}, y_{a}),a∈(0,1,…,4}. The locations of the five nodes are observed and verified through these coordinates. As discussed in section IV, a trust management procedure is used to find the trust scores of mobile nodes so as to verify these locations. A trust score is generated at a single point, which may be at a subgroup controller or central point. This trust score can be propagated or accumulated through multiple paths. State elimination is a process designed to shorten the path of a trust propagation without affecting the trust score value. This process absorbs or skips the states that do not affect the
A TS ( MN (i,j) (k,n) )
calculation. Table 3 shows the analysis of delays in detecting Sybil, eclipse, and desynchronization attacks. The results show that the proposed system detects the attacks in a very short time as compared to other systems.
In the proposed scheme, the source node, destination node, subgroup member, subgroup controller, intermediate node, primary subgroup, next layer subgroup, and so on are the actors in the scheme, and all actors are playing different roles within the scheme. For example, member nodes are a part of groups or subgroups. These groups or subgroups are controlled by a subgroup controller. Every subgroup controller can generate a trust score, pass a trust score to a neighboring subgroup controller, collect and verify the locations of nodes, and so on. In contrast, each intermediate node does not play the role of a controller. However, an intermediate node with a high health score can act as a next-layer subgroup controller. In addition, an intermediate node can collect or pass the
A TS ( MN (i,j) (k,n) )
to neighboring nodes. Passing states are absorbed when they are not affecting the results of trust propagations. Hence, one node can play multiple roles. There should not be any conflict of interest among any member in playing its role. A well-defined policy can avoid such conflicts. For example, Fig. 6 shows an example of subgroup controller policies. In this example, six policies are designed and implemented with the help of a subject (s), an action (a), and a resource (r). The subject (s) is an actor in a network and can perform various actions (FormSubgroup, AssignID, RetrieveID, ActController, and so on) on resources (LocalGroup, GlobalGroup, Hierarchy, Network, and so on). In the first policy, all interested and permitted members are allowed to act as controller. In the next three policies, interested and permitted controllers can control a local subgroup, a global subgroup (a subgroup from another network), or a hierarchy (if the controller is a member of a root subgroup). A permitted and non-conflicting controller can assign unique identification marks to LocalGroup members. Similarly, policies for other actors are designed and analyzed in Margrave [8]–[9]. The results show that there is no conflict in the role of any actor.
Counter example of controller policy analysis in proposed scheme using Margrave.
VII. Conclusion
This paper examined a sequence of steps in RFID sensor–based MANETs to construct a lightweight secure environment. An ECC in a code-based cryptosystem is used to analyze identification, key generation, authentication, and location verification protocols in lightweight cryptography. An Alloy analyzer is used to construct a lightweight model for the proposed sequence of steps to integrate the protocols. This analysis shows that ten nodes and five processes in a subgroup are used to construct a network that detects Sybil, eclipse and desynchronization attacks in only a few milliseconds. Network construction is administered through actors. Subgroup members, subgroup controllers, source nodes, destination nodes, and intermediate nodes are the actors that control the network’s activities. A Margrave policy analysis shows that there is no conflict of interest among the different roles of the actors.
BIO
Corresponding Authoradarsh.kumar@jiit.ac.inAdarsh Kumar received his ME degree in software engineering from Thapar University, Patiala, Punjab, India, in 2003. Since 2003, he has been with the Department of Computer Science Engineering and Information Technology, Jaypee Institute of Information Technology, Noida, India, where he is now an assistant professor. His main research interests are cryptography, network security, and ad hoc networks.
mesoft_adarsh@rediffmail.comKrishna Gopal received his BTECH degree in electrical engineering from the Department of Electrical Engineering, IIT, Madras, India, in 1966 and his MS and PhD degrees in engineering from the REC Kurukshetra, India, in 1972 and 1979, respectively. Since 2011, he has been working as a dean (Academic & Research) with JIIT, Noida, India. He has forty-five years of teaching and research experience. He is a member of various professional bodies, such as the Life Member System Society of India, the Indian Society for Technical Education, and the IEEE.
director@jpiet.comAlok Aggarwal received his BTECH and MTECH degrees in computer science engineering from the Department of Computer Science, Kurukshetra University, India, in 1995 and 2001, respectively and his PhD degree in engineering from IIT, Roorkee, India, in 2010. From 2009 to 2012, he worked for the Jaypee Institute of Information Technology, Noida, India. Since 2012, he has been with the JP Institute of Engineering and Technology, Meerut, India, where he is now both a professor and a director. His main research interests are wired/wireless networks, security, and coding theory.
Zhang L.
,
Wang Z.
“Integration of RFID into Wireless Sensor Networks: Architectures, Opportunities and Challenging Problems,”
Proc. Int. Conf. Grid Cooperative Comput. Workshops
Hunan, China
Oct. 21–23, 2006
463 -
469
Englund C.
,
Wallin H.
2004
“RFID in Wireless Sensor Network,” M.S. thesis
Commun. Syst. Group, Dept. Signals Syst., Chalmers University of Technology
Goteborg, Sweden
Ferguson R.B.
2006
Gentag Patent Adds RFID Sensor Network Feature to Mobile Devices
Mobile News and Reviews, eWeek
http://www.eweek.com/c/a/Mobile-and-Wireless/Gentag-Patent-Adds-RFID-Sensor-Network-Feature-to-Mobile-Devices
Kumar A.
,
Aggarwal A.
,
Charu T.
“Efficient Hierarchical Threshold Symmetric Group Key Management Protocol for Mobile Ad Hoc Networks,”
Int. Conf. Contemporary Comput.
Noida, India
Aug. 6–8, 2012
335 -
346
Kumar A.
,
Gopal K.
,
Aggarwal A.
“Outlier Detection and Treatment for Lightweight Mobile Ad Hoc Networks,”
Int. Conf. Heterogeneous Netw. Quality, Rel., Security Robustness
Greader Noida, India
Jan. 11–12, 2013
750 -
763
Saghafi S.
,
Nelson T.
,
Dougherty D.J.
“Geometric Logic for Policy Analysis,”
Int. Workshop Autom. Reasoning Security Softw. Verification
Lake Placid, NY, USA
June 9, 2013
12 -
20
Jackson D.
2002
“A Micromodels of Software: Lightweight Modelling and Analysis with Alloy,”
Software Design Group, MIT Lab Manual, MIT
Cambridge, USA
1 -
58
McEliece R.J.
1978
“A Public Key Cryptosystem Based on Algebraic Coding Theory,”
Jet Propulsion Lab.
CA, USA
Deep Space Network Progress, Report 42–44
114 -
116
Minder L.
,
Shokrollahi A.
“Cryptanaysis of the Sidelnikov Cryptosystem,”
EUROCRYPT
Barcelona, Spain
May 20–24, 2007
347 -
360
DOI : 10.1007/978-3-540-72540-4_20
Faure C.
,
Minder L.
“Cryptanalysis of the McElice Cryptosystem over Hyper Elliptic Codes,”
Int. Workshop Algebraic Combinatorial Coding Theory
Pamporovo, Bulgaria
June 16–22, 2008
99 -
107
Gibson J.K.
“The Security of the Gabidulin Public Key Cryptosystem,”
Adv. Cryptology, EUROCRYPT
Saragossa, Spain
May 12–16, 1996
212 -
223
DOI : 10.1007/3-540-68339-9_19
Overbeck R.
2008
“Structural Attacks for Public Key Cryptosystems Based on Gabidulin Codes,”
J. Cryptology
21
(2)
280 -
301
DOI : 10.1007/s00145-007-9003-9
Sastry N.
,
Shankar U.
,
Wagner D.
“Secure Verification of Location Claims,”
ACM Workshop Wireless Security
San Diego, CA, USA
Sept. 28, 2003
1 -
10
DOI : 10.1145/941311.941313
Capkun S.
,
Cagalj M.
,
Srivastava M.
“Secure Localization with Hidden and Mobile Base Stations,”
IEEE INFOCOM
Barcelona, Spain
Apr. 23–29, 2006
1 -
10
Talasila M.
,
Curtmola R.
,
Borcea C.
“LINK: Location Verification through Immediate Neighbors Knowledge,”
Int. Conf. Mobile Ubiquitous Syst.: Comput. Netw. Serv.
Sydney, Australia
Dec. 6–9, 2010
210 -
223
DOI : 10.1007/978-3-642-29154-8_18
Molnar D.
,
Soppera A.
,
Wagner D.
“A Scalable Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags,”
Sel. Areas Cryptography
Kingston, Canada
Aug. 11–12, 2005
276 -
290
DOI : 10.1007/11693383_19
Tian Y.
,
Chen G.
,
Li J.
2012
“A New Ultra lightweight RFID Authentication Protocol with Permutation,”
IEEE Commun. Lett.
16
(5)
702 -
705
DOI : 10.1109/LCOMM.2012.031212.120237
Lee C.-F.
2010
“Anonymous RFID Yoking Protocol Using Error Correction Codes,”
Int. Conf. Radio Freq. Identification Syst. Security
Singapore City, Singapore
147 -
157
Fong P.W.L.
2011
“Preventing Sybil Attacks by Privilege Attenuation: A Design Principle for Social Network Systems,”
IEEE Symp. Security Privacy
Berkely, CA, USA
263 -
278
DOI : 10.1109/SP.2011.16
Singh A.
“Defending against Eclipse Attacks on Overlay Networks,”
ACM Special Interest Group Operating Syst. European Workshops
Leuven, Belgium
Sept. 19–22, 2004
Article 21
1 -
6
Mujahid U.
,
Najam-ul-islam M.
,
Ahmed J.
2013
“Ultra lightweight Cryptography for Passive RFID System,”
IACR Cryptology ePrint Archive, Report 2013/847
Deursen T.-V.
,
Radomirovic S.
2009
“Security of RFID Protocols – A Case Study,”
Electron. Notes Theoretical Comput. Sci.
244
41 -
52
DOI : 10.1016/j.entcs.2009.07.037
Aguilar C.
,
Gaborit P.
,
Schrek J.
“A New Zero-Knowledge Code Based Identification Scheme with Reduced Communication,”
Inf. Theory Workshop
Paraty, Brazil
Oct. 16–20, 2011
648 -
652
DOI : 10.1109/ITW.2011.6089577
Cerpa A.
“Habitat Monitoring Application Driver for Wireless Communication Technology,”
ACM SIGCOMM Workshop Data Commun.
San Jose, Costa Rica
Aug. 27–31, 2001
31
(2)
20 -
41
DOI : 10.1145/844193.844196
Dutta N.
,
Chellappan S.
“A Time-Series Clustering Approach for Sybil Attack Detection in Vehicular Ad Hoc Networks,”
Int. Conf. Adv. Veh. Syst., Technol. Appl.
Nice, France
July 21–26, 2013
35 -
40
Lee B.
,
Jeong E.
,
Jung I.
2013
“A DTSA (Detection Technique against a Sybil Attack) Protocol Using SKC (Session Key Based Certificate) on VANET,”
Int. J. Security its Appl.
7
(3)
1 -
10
Zhou T.
2011
“P2DAP – Sybil Attacks Detection in Vehicular Ad Hoc Networks,”
IEEE J. Sel. Areas Commun.
29
(3)
582 -
594
DOI : 10.1109/JSAC.2011.110308
Niu B.
,
Zhu X.
,
Li H.
“An Ultra lightweight and Privacy Preserving Authentication Protocol for Mobile RFID Systems,”
IEEE Wireless Commun. Netw. Conf.
Shanghai, China
Apr. 7–10, 2013
1864 -
1869
DOI : 10.1109/WCNC.2013.6554848
Citing 'Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs
'
@article{ HJTODO_2015_v37n1_186}
,title={Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs}
,volume={1}
, url={http://dx.doi.org/10.4218/etrij.15.0114.0177}, DOI={10.4218/etrij.15.0114.0177}
, number= {1}
, journal={ETRI Journal}
, publisher={Electronics and Telecommunications Research Institute}
, author={Kumar, Adarsh
and
Gopal, Krishna
and
Aggarwal, Alok}
, year={2015}
, month={Feb}
TY - JOUR
T2 - ETRI Journal
AU - Kumar, Adarsh
AU - Gopal, Krishna
AU - Aggarwal, Alok
SN - 1225-6463
TI - Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs
VL - 37
PB - Electronics and Telecommunications Research Institute
DO - 10.4218/etrij.15.0114.0177
PY - 2015
UR - http://dx.doi.org/10.4218/etrij.15.0114.0177
ER -
Kumar, A.
,
Gopal, K.
,
&
Aggarwal, A.
( 2015).
Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs.
ETRI Journal,
37
(1)
Electronics and Telecommunications Research Institute.
doi:10.4218/etrij.15.0114.0177
Kumar, A
,
Gopal, K
,
&
Aggarwal, A
2015,
Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs,
ETRI Journal,
vol. 1,
no. 1,
Retrieved from http://dx.doi.org/10.4218/etrij.15.0114.0177
[1]
A Kumar
,
K Gopal
,
and
A Aggarwal
,
“Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs”,
ETRI Journal,
vol. 1,
no. 1,
Feb
2015.
Kumar, Adarsh
and
,
Gopal, Krishna
and
,
Aggarwal, Alok
and
,
“Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs”
ETRI Journal,
1.
1
2015:
Kumar, A
,
Gopal, K
,
Aggarwal, A
Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs.
ETRI Journal
[Internet].
2015.
Feb ;
1
(1)
Available from http://dx.doi.org/10.4218/etrij.15.0114.0177
Kumar, Adarsh
,
Gopal, Krishna
,
and
Aggarwal, Alok
,
“Novel Trusted Hierarchy Construction for RFID Sensor–Based MANETs Using ECCs.”
ETRI Journal
1
no.1
()
Feb,
2015):
http://dx.doi.org/10.4218/etrij.15.0114.0177