LKHW: a directed diffusion-based secure multicast scheme for wireless sensor networks

Pietro, Roberto Di; Mancini, Luigi V.; Law, Yee Wei; Etalle, Sandro; Havinga, Pjm

doi:10.1109/icppw.2003.1240395

Cited by 96 publications

(87 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the literature, there has been some work that protects previously existent routing protocols such as directed diffusion [22]. Another branch of research focused on discovering new protection techniques.…”

Section: Routingmentioning

confidence: 99%

On the Security of Wireless Sensor Networks

Román

Zhou

López

2005

Computational Science and Its Applications – ICCSA 2005

View full text Add to dashboard Cite

Abstract. Wireless Sensor Networks are extremely vulnerable against any kind of internal or external attacks, due to several factors such as resource-constrained nodes and lack of tamper-resistant packages. As a result, security must be an important factor to have in mind when designing the infrastructure and protocols of sensor networks. In this paper we survey the "state-of-the-art" security issues in sensor networks and highlight the open areas of research.

show abstract

Section: Routingmentioning

confidence: 99%

On the Security of Wireless Sensor Networks

Román

Zhou

López

2005

Computational Science and Its Applications – ICCSA 2005

View full text Add to dashboard Cite

show abstract

“…In this paper we use this graph for t = O(log N ), therefore the property above can be checked explicitly in time polynomial in N . This gives a Las Vegas algorithm for constructing graphs D t with a polynomial expected running time 17 . We can also show the following.…”

Section: Theorem 4 ([24]mentioning

confidence: 99%

“…[28,29,13,8,35,17] and many more). These are proof systems where a verifier sends a file F to a prover, and later the prover can convince the verifier that it really stored or received the file.…”

Section: Introductionmentioning

confidence: 99%

Proofs of Space

Dziembowski

Faust

Kolmogorov

et al. 2015

Lecture Notes in Computer Science

245

159

View full text Add to dashboard Cite

Abstract. Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto'92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs -so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high "pebbling complexity" and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log log N ) such that even if one places Θ(N ) pebbles on the nodes of the graph, there's a constant fraction of nodes that needs Θ(N ) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble).

show abstract

“…NB: the size of q= key size = the size of the polynomial coefficients LKH [3] is a well-known and basic scheme on which several group rekeying schemes are based [40,4,41,14,15,5,6]. TKH [5] is a group rekeying scheme that uses the concept of matching the physical topology to the logical key hierarchy.…”

Section: Notations Meaning Tmentioning

confidence: 99%

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

et al. 2012

View full text Add to dashboard Cite

a b s t r a c tSecure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

show abstract

LKHW: a directed diffusion-based secure multicast scheme for wireless sensor networks

Cited by 96 publications

References 20 publications

On the Security of Wireless Sensor Networks

On the Security of Wireless Sensor Networks

Proofs of Space

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

Contact Info

Product

Resources

About