9 research outputs found
Recommended from our members
DECENT: Decentralized and efficient key management to secure communication in dense and dynamic environments
Intelligent Transportation Systems (ITS), one aspect of the Smart City paradigm, aim to improve the efficiency, convenience, and safety of travelers. The integration of (vehicular) communication technologies allows communication between the on-board communication units (OBUs) of vehicles, roadside units (RSUs), and vulnerable road users (VRUs), and contribute to the efficacy of ITS applications. However, these additional sources of information must be reliable and accurate. Security primitives such as confidentiality, integrity, and authenticity are required, but only achievable when supported with a suitable cryptographic key management scheme. This paper presents the design of a decentralized and efficient key management scheme, abbreviated as the DECENT scheme. This scheme provides secure multihop communication in dense and dynamic network environments while functioning in a self-organized manner. Through threshold secret sharing techniques, network nodes act as a distributed trusted third party (TTP) such that a threshold number of nodes can collaborate to execute key management functions. These functions include decentralized node admission and key updating. Novelties include (i) the unique self-healing characteristic, meaning that DECENT is capable of independently recovering from network compromise, and (ii) guidelines for choosing an appropriate security threshold in any deployment scenario which maximizes the level of security while simultaneously guaranteeing that decentralized key management services can be provided
Recommended from our members
DISTANT: DIStributed trusted Authority-based key managemeNT for beyond 5G wireless mobile small cells
The 5G mobile network is embracing new technologies to keep providing network subscribers with a high Quality of Service (QoS). However, this has become increasingly difficult in the urban landscape as more devices are being connected and each device is requesting increasing amounts of data. Network operators rely on the small cell technology to maintain coverage and service for its subscribers, but this technology is incapable of mitigating the increasing workload on the network infrastructure and preventing the associated network delays. The next logical step is to cover the urban landscape with mobile small cells, since these take advantage of the dynamic network topology and optimizes network services in a cost-effective fashion while taking advantage of the high device density. However, the introduction of mobile small cells raises various security challenges. Cryptographic solutions are capable of solving these as long as they are supported by an appropriate key management scheme. In this article, we propose DISTANT: a DIStributed Trusted Authoritybased key managemeNT scheme. This key management scheme is specifically designed to provide security in a network which takes advantage of the mobile small cell technology. The scheme relies on threshold secret sharing to decentralize trust and utilizes the self-generated certificates paradigm. Through an extensive security analysis and communication overhead evaluation, we conclude that our design provides an improved level of security and has a low communication overhead compared to previous works
How to Share Secret Efficiently over Networks
In a secret-sharing scheme, the secret is shared among a set of shareholders, and it can be reconstructed if a quorum of these shareholders work together by releasing their secret shares. However, in many applications, it is undesirable for nonshareholders to learn the secret. In these cases, pairwise secure channels are needed among shareholders to exchange the shares. In other words, a shared key needs to be established between every pair of shareholders. But employing an additional key establishment protocol may make the secret-sharing schemes significantly more complicated. To solve this problem, we introduce a new type of secret-sharing, called protected secret-sharing (PSS), in which the shares possessed by shareholders not only can be used to reconstruct the original secret but also can be used to establish the shared keys between every pair of shareholders. Therefore, in the secret reconstruction phase, the recovered secret is only available to shareholders but not to nonshareholders. In this paper, an information theoretically secure PSS scheme is proposed, its security properties are analyzed, and its computational complexity is evaluated. Moreover, our proposed PSS scheme also can be applied to threshold cryptosystems to prevent nonshareholders from learning the output of the protocols
A Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks
An ad hoc wireless network is a set of wireless mobile nodes that self-configure to build a network without the requirement for any reputable infrastructure or backbone. Mobile nodes are utilized by the Ad hoc networks to facilitate effective communication beyond the wireless transmission range. As ad hoc networks do not impose any fixed infrastructure, it becomes very tough to handle network services with the available routing approaches, and this creates a number of problems in ensuring the security of the communication. Majority of the existing ad hoc protocols that deal with security issues depends on implicit trust relationships to route packets among participating nodes. The general security objectives like authentication, confidentiality, integrity,availability and nonrepudiation should not be compromised in any circumstances. Thus, security in ad hoc networks becomes an active area of research in the field of networking. There are various techniques available in the literature for providing security to the ad hoc networks. This paper focuses on analyzing the various routing protocols available in the literature for ad hoc network environment and its applications in security mechanisms
Efficient, Reliable and Secure Distributed Protocols for MANETs
This thesis is divided into two parts. The first part explores the difficulties of
bootstrapping and maintaining a security infrastructure for military Mobile Ad Hoc
NETworks (MANETs). The assumed absence of dedicated infrastructural elements
necessitates, that security services in ad hoc networks may be built from the ground
up. We develop a cluster algorithm, incorporating a trust metric in the cluster head
selection process to securely determine constituting nodes in a distributed Trust
Authority (TA) for MANETs. Following this, we develop non-interactive key distribution
protocols for the distribution of symmetric keys in MANETs. We explore
the computational requirements of our protocols and simulate the key distribution
process.
The second part of this thesis builds upon the security infrastructure of the first
part and examines two distributed protocols for MANETs. Firstly, we present a
novel algorithm for enhancing the efficiency and robustness of distributed protocols
for contacting TA nodes in MANETs. Our algorithm determines a quorum of
trust authority nodes required for a distributed protocol run based upon a set of
quality metrics, and establishes an efficient routing strategy to contact these nodes.
Secondly, we present a probabilistic path authentication scheme based on message
authentication codes (MACs). Our scheme minimises both communication and computation
overhead in authenticating the path over which a stream of packets travels
and facilitates the detection of adversarial nodes on the path
A Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks
An ad hoc wireless network is a set of wireless mobile nodes that self-configure to build a network without the requirement for any reputable infrastructure or backbone. Mobile nodes are utilized by the Ad hoc networks to facilitate effective communication beyond the wireless transmission range. As ad hoc networks do not impose any fixed infrastructure, it becomes very tough to handle network services with the available routing approaches, and this creates a number of problems in ensuring the security of the communication. Majority of the existing ad hoc protocols that deal with security issues depends on implicit trust relationships to route packets among participating nodes. The general security objectives like authentication, confidentiality, integrity,availability and nonrepudiation should not be compromised in any circumstances. Thus, security in ad hoc networks becomes an active area of research in the field of networking. There are various techniques available in the literature for providing security to the ad hoc networks. This paper focuses on analyzing the various routing protocols available in the literature for ad hoc network environment and its applications in security mechanisms
Protected Secret Sharing and its Application to Threshold Cryptography
Title from PDF of title page, viewed April 19, 2017Thesis advisor: Lein HarnVitaIncludes bibliographical references (pages 36-40)Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2016In the secret reconstruction of Shamir’s (t,n) secret sharing scheme (SS), shares
released by shareholders need to be protected otherwise, non-shareholders can also obtain the
secret. Key establishment protocol can establish pairwise keys for any pair of shareholders.
Then, shareholders can use these pairwise keys to protect shares in the secret reconstruction
process. However, adding a key establishment in the secret reconstruction slows down the
process significantly. Shamir’s SS is based on a univariate polynomial. Shares generated by a
bivariate polynomial enable pairwise keys to be shared between any pair of shareholders. But
we proposed a new type of SS, called protected secret sharing scheme (PSS), in which shares
of shareholders can not only be used to reconstruct the secret but also be used to protect the
secrecy of shares in the secret reconstruction process. Thus, the recovered secret is only
available to shareholders but not to non-shareholders. A basic (t,n) PSS based on a bivariate
polynomial is proposed. Furthermore, we introduce to use this basic PSS in the applications
of threshold cryptography. The PSS is unique since it protects the secrecy of the recovered
secret in a very efficient way.Introduction -- Related work -- Our scheme -- Security analysis and performance -- Application to algorithms of threshold cryptography -- Conclusio