Secure group communication schemes for dynamic heterogeneous distributed computing

Castiglione, Arcangelo; D’Arco, Paolo; Santis, Alfredo De; Russo, Rosario

doi:10.1016/j.future.2015.11.026

Cited by 29 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Identity authentication is mainly used to determine the sender of information and exchange communication keys between two communication parties. Since nodes in a WSN are relatively easy for attackers to capture, we can use identity authentication mechanisms to verify the captured nodes [12][13][14][15]. Due to the constrained computing and energy capabilities, identity authentication via a symmetric key algorithm is more feasible than the traditional approach based on public key encryption in WSNs [3,16].…”

Section: Related Workmentioning

confidence: 99%

Information-Aware Secure Routing in Wireless Sensor Networks

Shi

Ding

et al. 2019

Sensors

View full text Add to dashboard Cite

Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes. For each relay node in the route, associated information such as its trust value and status is considered in the protocol. The trust value is defined as the attack probability of the node according to previous packet-forwarding behaviors, and the status is a hybrid metric that combines the residual energy and distance to the sink node. Therefore, the route generated by the protocol is secure against malicious attacks and globally optimal according to the associated information. We used an improved variant of the Dijkstra algorithm to generate the secure route for WSNs in the presence of malicious nodes. Compared with the Reputation-Based Mechanism to Stimulate Cooperation (RBMSC) model in the same simulation environment, the proposed model can maintain a higher delivery ratio, which verifies the effectiveness of the proposed model on the basis of global optimization. Furthermore, compared with the traditional Dijkstra algorithm, the packet loss ratio in the improved Dijkstra algorithm is lower because it can more effectively avoid malicious nodes, thus verifying the effectiveness of the improved algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Information-Aware Secure Routing in Wireless Sensor Networks

Shi

Ding

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…A particular use case of replay attack that retransmitted a legitimate plaintext set-point command after modifying it bypassed the DER client credentials and was successfully accepted by the device [126]. Different cryptographic techniques can prevent MITM and replay attacks considering the use of strong key distribution and exchange schemes [127]. It has also been shown through research that DER applications using TCP-based communications, by virtue of their three-way handshake and inclusion of the sequence number in their header, are less susceptible to replay than those using UDP.…”

Section: Key Observationsmentioning

confidence: 99%

A Survey of Protocol-Level Challenges and Solutions for Distributed Energy Resource Cyber-Physical Security

et al. 2018

View full text Add to dashboard Cite

The increasing proliferation of distributed energy resources (DERs) on the smart grid has made distributed solar and wind two key contributors to the expanding attack surface of the network; however, there is a lack of proper understanding and enforcement of DER communications security requirements. With vendors employing proprietary methods to mitigate hosts of attacks, the literature currently lacks a clear organization of the protocol-level vulnerabilities, attacks, and solutions mapped to each layer of the logical model such as the OSI stack. To bridge this gap and pave the way for future research by the authors in determining key DER security requirements, this paper conducts a comprehensive review of the key vulnerabilities, attacks, and potential solutions for solar and wind DERs at the protocol level. In doing so, this paper serves as a starting point for utilities, vendors, aggregators, and other industry stakeholders to develop a clear understanding of the DER security challenges and solutions, which are key precursors to comprehending security requirements.

show abstract

“…Work within the Authentication space of IoTs has been significant -mainly in mechanisms to create and distribute keys efficiently and securely throughout a network [7]- [9]. Most of these solutions face significant issues with adaptable heterogenous networks where the nodes are ephemeral -either due to movement physical movement out of the network, addition to the environment, or destruction via some outside force.…”

Section: A Related Workmentioning

confidence: 99%

S-CHIRP: Secure communication for heterogeneous IoTs with round-robin protection

Borowczak¹,

Purdy²

2018

2018 IEEE International Conference on Consumer Electronics (ICCE)

View full text Add to dashboard Cite

This work introduces CHIRP -an algorithm for communication between ultra-portable heterogeneous IoT devices with a type of round-robin protection mechanism. This algorithm is presented both in its basic form as well as in a secured form in order to secure and maintain trust boundaries and communication within specific groups of heterogeneous devices. The specific target application scenarios includes resource constrained environments where a co-located swarm of devices (adversarial in mission or objective) is also present. CHIRP, and its secured version (S-CHIRP), enables complete peer-to-peer communication of a n-agent network of devices in as few as n rounds. In addition to the n-round cycle length, the proposed communication mechanism has the following major properties: nodes communication is entirely decentralized, communication is resilient to the loss of nodes, and finally communication is resilient to the (re)-entry of nodes. Theoretical models show that even the secure implementation of this mechanism is capable of scaling to IoT swarms in the million device range with memory constraints in the < 10 MB range.

show abstract

Secure group communication schemes for dynamic heterogeneous distributed computing

Cited by 29 publications

References 10 publications

Information-Aware Secure Routing in Wireless Sensor Networks

Information-Aware Secure Routing in Wireless Sensor Networks

A Survey of Protocol-Level Challenges and Solutions for Distributed Energy Resource Cyber-Physical Security

S-CHIRP: Secure communication for heterogeneous IoTs with round-robin protection

Contact Info

Product

Resources

About