Secure, Redundant, and Fully Distributed Key Management Scheme for Mobile Ad Hoc Networks: An Analysis

Joshi, Deepti; Namuduri, Kamesh; Pendse, Ravi

doi:10.1155/wcn.2005.579

Cited by 27 publications

(25 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We illustrate the query post-processing procedure through the following example: Given the plaintext values {10, 11,13,14,17} with δ = 0.5, and the weights {0. 1 …”

Section: Efficient Query Processing Over Encrypted Datamentioning

confidence: 99%

“…To fulfill the security requirements raised by the distributed data storage, recent research has started studying distributed access control, data confidentiality, and data integrity. [11] introduced a redundancy-based key distribution scheme that utilizes secret sharing to achieve a decentralized certificate authority. [12] studied to perform secure distributed data storage by developing an adaptive polynomial-based data storage scheme.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks

Liu

Wang

Chen

2010

Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

Abstract. As wireless networks become more pervasive, the amount of the wireless data is rapidly increasing. One of the biggest challenges is how to store these data. To address this challenge, distributed data storage in wireless networks has attracted much attention recently, as it has major advantages over centralized approaches. To support the widespread adoption of distributed data storage, secure data storage must be achieved. In this work, we study the frequency-based attack, a type of attack that is different from previously well-studied ones, that exploits additional adversary knowledge to crack the encrypted data. To cope with frequency-based attacks, the straightforward 1-to-1 substitution encryption functions are not sufficient. We propose a data encryption strategy based on 1-to-n substitution via dividing and emulating techniques such that an attacker cannot derive the mapping relationship between the encrypted data and the original data based on their knowledge of domain values and their occurrence frequency. Our simulation results show that our data encryption strategy can achieve high security guarantee with low overhead.

show abstract

“…We illustrate the query post-processing procedure through the following example: Given the plaintext values {10, 11,13,14,17} with δ = 0.5, and the weights {0. 1 …”

Section: Efficient Query Processing Over Encrypted Datamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks

Liu

Wang

Chen

2010

Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

show abstract

“…al propose a fully distributed certificate authority scheme based on secret sharing and redundancy [61]. In secret sharing mechanism, the certificate authority's private key is first divided into parts.…”

Section: Joshi's Approachmentioning

confidence: 99%

A survey of survivability in mobile ad hoc networks

Lima

Santos

Pujolle

2009

IEEE Commun. Surv. Tutorials

112

View full text Add to dashboard Cite

Considerable improvements have been made towards providing ad hoc network security. However, conventional lines of defense are inefficient to put all attacks and intrusions off. In view of security limitations, we present a survey of the most relevant survivable initiatives for MANETs. Survivability is defined as the network ability to fulfill correctly its functions even in the presence of attacks or intrusions. We propose a new classification of the defense lines taking into account the resiliencyoriented approach and we identify survivability properties. Survivable initiatives are described and categorized into three groups: routing discovery, data transmission and key management. We observed that security solutions focus still on one network layer or one type of attack, using essentially preventive or reactive mechanisms.

show abstract

“…Ref. [33] suggests more shares per node to succeed also with less than k neighbors. In effect, this solution gives little else than reducing the value of k. Distributing the CA functionality boosts the availability of private key shares.…”

Section: ) Public Key Schemesmentioning

confidence: 99%

A survey of key management in ad hoc networks

Hegland

Winjum

Mjølsnes

et al. 2006

IEEE Commun. Surv. Tutorials

110

View full text Add to dashboard Cite

Abstract-The wireless and dynamic nature of mobile ad hoc networks (MANETs) leaves them more vulnerable to security attacks than their wired counterparts. The nodes act both as routers and communication end-points. This makes the network layer more prone to security attacks. A main challenge is to judge whether a routing message originates from a trustworthy node or not. The solution so far is cryptographically signed messages. The general assumption is that nodes are in possession of a valid secret key can be trusted. Consequently, a secure and efficient key management scheme is crucial.Keys are also required for protection of application data. However, the focus here is on network layer management information. Whereas key management schemes for the upper layers can assume an already running network service, schemes for the protection of the network layer cannot. Keys are a prerequisite to bootstrap a protected network service. This paper surveys the state of the art within key management for ad hoc networks, and analyzes their applicability for network layer security. The analysis puts some emphasis on their applicability in scenarios such as emergency and rescue operations as this work was initiated by a study of security in MANETs for emergency and rescue operations. IndexTerms-Ad hoc networks, key management, security, network layer, emergency and rescue operations.

show abstract

Secure, Redundant, and Fully Distributed Key Management Scheme for Mobile Ad Hoc Networks: An Analysis

Cited by 27 publications

References 21 publications

Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks

Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks

A survey of survivability in mobile ad hoc networks

A survey of key management in ad hoc networks

Contact Info

Product

Resources

About