Efficient Key Management Research Articles

Efficient Key Management for EnforcingSecure Role Based Access Control onEncrypted Data in Cloud Storage

In the existing system, role manager give authorization to user when he begins encryption. After that user have all the permission to access the function. The project developed by access provides security by enabling the function of role manager. The role manager monitors every function to provide additional security. It includes two encryption and decryption (One by user and one by role manager. User use public & private key to encrypt and decrypt video, whereas role manager use AES to encrypt and decrypt video. Private Key frameworks utilize the same key to encode and decode information. Open key encryption functions admirably in circumstances where you can't safely impart a key, as over the Internet, however it has some real disadvantages. The main disadvantages of thistechnique are speed, certification problems, direct compromise, and false sense of security. AES encryption is a block cipher that uses an encryption key and a several rounds of encryption. A block cipher is an encryption that works on a single block of data at a time. In the case of standard AES encryption the block is 128 bits, or 16 bytes, in length. The term rounds refer to the way in which the encryption mixes the data re-encrypting it ten to fourteen times depending on the length of the key. The AES encryption itself is not a computer program or computer source code.

An Efficient Key Predistribution Protocol for Wireless Sensor Networks via Combinatorial Design

As Wireless Sensor Networks (WSNs) are usually deployed in remote or even hostile environment, the adoption of security mechanism is fundamental. To achieve secure communication between sensor nodes in WSNs, it is important to establish efficient key predistribution schemes. Unfortunately, key management scheme is a challenging issue for WSNs because of the resource limitations in the sensor nodes. In this paper, we propose an efficient key management scheme for WSNs, which assigns the key spaces to sensor nodes via combinatorial design. In the scheme Finite Projective Plane is mapped to obtain efficient key distribution scheme. Connectivity, resistance against attacks, storage and communication overhead are studied analytically and computationally. Compared to related schemes, the proposed scheme performs better against compromised node attacks.

On the Performance of a Secure Storage Mechanism for Key Distribution Architectures in Wireless Sensor Networks

Security in wireless sensor networks (WSNs) demands efficient key management schemes. In particular, one of the main research challenges is to ensure secure key storage by sensors due to their constrained resources and high exposure to tampering attempts. To address this issue, we have proposed SENSORLock, a secure key storage mechanism which can be applied to different key distribution architectures for WSNs. In this work, we evaluate SENSORLock through different study cases considering three key distribution architectures: TinySec, SPINS, and NCD. Our goal is to demonstrate its feasibility in large-scale sensor networks. Simulation results indicate that our mechanism introduces an average overhead of 1.9% in terms of end to end delay and provides a similar estimated power consumption compared to the aforementioned architectures. Hence, we argue that it is feasible to use SENSORLock (i) in large-scale sensor networks and (ii) under different key distribution schemes.

Scalable end-to-end security for advanced metering infrastructures

Conventional utility meters are increasingly being replaced with smart meters as Advanced Metering Infrastructures (AMIs) provide many benefits over conventional power infrastructures. However, security issues pertaining to data transmission between smart meters and utility servers are a major concern. In particular, as data travels through several networks, scalable key management schemes are crucial for secure end-to-end communications. In this paper, we propose an approach based on physically unclonable function (PUF) technology for providing strong hardware based authentication of smart meters and efficient key management to assure the confidentiality and integrity of messages exchanged in AMIs. Our approach does not require modifications to the existing smart meter communication. We have developed a proof-of-concept implementation of the proposed approach which is also briefly discussed in the paper.

Group Key Establishment for Enabling Secure Multicast Communication in Wireless Sensor Networks Deployed for IoT Applications

Wireless sensor networks (WSNs) are a prominent fundamental technology of the Internet of Things (IoTs). Rather than device-to-device communications, group communications in the form of broadcasting and multicasting incur efficient message deliveries among resource-constrained sensor nodes in the IoT-enabled WSNs. Secure and efficient key management is in many cases used to protect the authenticity, integrity, and confidentiality of multicast messages. This paper develops two group key establishment protocols for secure multicast communications among the resource-constrained devices in IoT. Major deployment conditions and requirements of each protocol are described in terms of the specific IoT application scenarios. Furthermore, the applicability of the two protocols is analyzed and justified by a comprehensive analysis of the performance, scalability, and security of the protocols proposed.

An Encryption-then-Compression System for JPEG/Motion JPEG Standard

In many multimedia applications, image encryption has to be conducted prior to image compression. This paper proposes a JPEG-friendly perceptual encryption method, which enables to be conducted prior to JPEG and Motion JPEG compressions. The proposed encryption scheme can provides approximately the same compression performance as that of JPEG compression without any encryption, where both gray scale images and color ones are considered. It is also shown that the proposed scheme consists of four block-based encryption steps, and provide a reasonably high level of security. Most of conventional perceptual encryption schemes have not been designed for international compression standards, but this paper focuses on applying the JPEG and Motion JPEG standards, as one of the most widely used image compression standards. In addition, this paper considers an efficient key management scheme, which enables an encryption with multiple keys to be easy to manage its keys.

Secured Communication Key Establishment for Cluster-Based Wireless Sensor Networks

The resource-constraint nature of wireless sensor networks (WSNs) has caused the security one of biggest challenges. An efficient key management scheme is the pre-requisite to ensure security in WSN. In this paper the authors present two versions of a secured key management scheme adopted on cluster-based topology of sensor network. The proposed schemes use partial key pre-distribution and symmetric cryptography techniques, and shows high resilience to different security attacks. Whereas one version of the proposed protocol uses shared partial keys in a cluster, the other version uses private partial keys. Both versions of the proposed key management scheme outperform other random key pre- distribution protocols in the sense that it requires lower space, lower communication overhead and offers very high session key candidates.

HIERARCHICAL ACCESS CONTROL IN DYNAMIC PEER GROUPS USING SYMMETRIC POLYNOMIAL AND TREE BASED GROUP ELLIPTIC CURVE DIFFIE HELLMAN SCHEME

Hierarchical Access Control in group communication is an active area of research which is difficult to achieve it. Its primary objective is to allow users of a higher authority group to access information or resource held by lower group users and preventing the lower group users to access information held by higher class users. Large collection of collaborative applications in organizations inherently has hierarchical structures for functioning, where providing security by efficient group key management is a big challenging issue. While preserving centralized methods for hierarchical access control, it is difficult to achieve efficiency as a single membership change will result in lot of changes which are difficult to maintain. So, using distributed key agreement techniques is more appropriate for this scenario. This study explore on novel group key agreement approach, which combines both the symmetric polynomial scheme and Tree Based Group elliptic Curve key exchange. Also, it yields a secure protocol suite that is good in fault-tolerant and simple. The efficiency of SP-TGECDH is better than many other schemes. Using TGECDH makes the scheme suitable small Low powered devices.

NaEPASC: a novel and efficient public auditing scheme for cloud data

Cloud computing is deemed the next-generation information technology (IT) platform, in which a data center is crucial for providing a large amount of computing and storage resources for various service applications with high quality guaranteed. However, cloud users no longer possess their data in a local data storage infrastructure, which would result in auditing for the integrity of outsourced data being a challenging problem, especially for users with constrained computing resources. Therefore, how to help the users complete the verification of the integrity of the outsourced data has become a key issue. Public verification is a critical technique to solve this problem, from which the users can resort to a third-party auditor (TPA) to check the integrity of outsourced data. Moreover, an identity-based (ID-based) public key cryptosystem would be an efficient key management scheme for certificate-based public key setting. In this paper, we combine ID-based aggregate signature and public verification to construct the protocol of provable data integrity. With the proposed mechanism, the TPA not only verifies the integrity of outsourced data on behalf of cloud users, but also alleviates the burden of checking tasks with the help of users’ identity. Compared to previous research, the proposed scheme greatly reduces the time of auditing a single task on the TPA side. Security analysis and performance evaluation results show the high efficiency and security of the proposed scheme.

A dynamic key management scheme for dynamic wireless sensor networks

AbstractDynamic wireless sensor network (DWSN) is a group of mobile sensor nodes deployed in an intended area. Secure communication in DWSNs depends on the existence of an efficient key management scheme. Because of the movements of sensor nodes and unknown mobility pattern, dynamic key management is an important issue in such networks. In this paper, we propose a new key management scheme, which uses key pre‐distribution and post‐deployment key establishment mechanisms for DWSNs. The proposed approach ensures that the two communicating nodes share at least one common key. It also provides efficient ways for key generation and revocation as well as addition or deletion of mobile sensor nodes. Compared with the other key management schemes, which are designed for DWSNs, our simulation and analytical results demonstrate the efficiency of the proposed approach in terms of confidentiality, resilience, memory usage, energy consumption and overhead. Copyright © 2014 John Wiley & Sons, Ltd.

EFFICIENT KEY MANAGEMENT AND AUTHENTICATION SCHEME FOR WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSN) is vulnerable to node capture attacks in which an attacker can capture one or more sensor nodes and reveal all stored security information which enables him to compromise a part of the WSN communications. Due to large number of sensor nodes and lack of information about deployment and hardware capabilities of sensor node, key management in wireless sensor networks has become a complex task. Limited memory resources and energy constraints are the other issues of key management in WSN. Hence an efficient key management scheme is necessary which reduces the impact of node capture attacks and consume less energy. In this study, we develop a cluster based technique for key management in wireless sensor network.

Efficient Authentication and Key Management Mechanisms for Smart Grid Communications

A smart grid (SG) consists of many subsystems and networks, all working together as a system of systems, many of which are vulnerable and can be attacked remotely. Therefore, security has been identified as one of the most challenging topics in SG development, and designing a mutual authentication scheme and a key management protocol is the first important step. This paper proposes an efficient scheme that mutually authenticates a smart meter of a home area network and an authentication server in SG by utilizing an initial password, by decreasing the number of steps in the secure remote password protocol from five to three and the number of exchanged packets from four to three. Furthermore, we propose an efficient key management protocol based on our enhanced identity-based cryptography for secure SG communications using the public key infrastructure. Our proposed mechanisms are capable of preventing various attacks while reducing the management overhead. The improved efficiency for key management is realized by periodically refreshing all public/private key pairs as well as any multicast keys in all the nodes using only one newly generated function broadcasted by the key generator entity. Security and performance analyses are presented to demonstrate these desirable attributes.

Implementation of an RFID Key Management System for DASH7

The wireless sensor networking standard DASH7 operates in low-power communication with a better transmission quality in active RFID networks. The DASH7 security standard supports public key cryptography. At present, the DASH7 standard uses the message authentication code in the network layer for authentication and integrity. However, its security standard is still in an incubation stage with respect to the implementation of a crypto exchange over a DASH7 network. Effective key management is an important factor for privacy and security. If organizations are not careful about where and how keys are stored, they leave the encrypted data vulnerable to theft. In this regard, we present a key management system designed for efficient key management through public key infrastructure authentication as well as a non-repudiation feature for the DASH7 standard. We analyze the performance of the proposed system on a basis of various performance criteria such as latency and throughput.

Cloud-Assisted Mobile-Access of Health Data With Privacy and Auditability

Motivated by the privacy issues, curbing the adoption of electronic healthcare systems and the wild success of cloud service models, we propose to build privacy into mobile healthcare systems with the help of the private cloud. Our system offers salient features including efficient key management, privacy-preserving data storage, and retrieval, especially for retrieval at emergencies, and auditability for misusing health data. Specifically, we propose to integrate key management from pseudorandom number generator for unlinkability, a secure indexing method for privacy-preserving keyword search which hides both search and access patterns based on redundancy, and integrate the concept of attribute-based encryption with threshold signing for providing role-based access control with auditability to prevent potential misbehavior, in both normal and emergency cases.

English

Wireless Sensor Network (WSN) challenges in the transmission of data are its network traffic and network security. Another issue in sensor network is Compromised node and Denial -of -service attack (DOS).Multipath Routing Algorithms are vulnerable to these attacks. A Key Management scheme is used with this routing algorithm to generate randomized multipath routes for secure transmission of data to the sink. We adopt Shamir's algorithm for efficient key management which is scalable, highly secure and decreases communication overhead. Randomized Route Generation changes the routes taken by the shares from time to time thereby increasing the probability of randomness of paths to be selected for transferring data in a much secured manner. To bypass the black hole, opponent has to selectively compromise nodes or block the shares containing the message which traverse randomly which is very difficult.

An Efficient Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Key management plays fundamental role in research on security service in wireless sensor networks (WSNs). However, due to the resource constraints, establishing pairwise keys in WSNs is not a trivial tasks. Several exiting key management schemes have been proposed in literature to establish pairwise keys between sensor nodes, but they either can not offer strong resilience against node capture attacks or have overly large memory requirement to achieve high degree of connectivity. In this paper, we prose an efficient pairwise key management scheme. In the proposed scheme, the sensor nodes are given different security level and the compromised sensor nodes cannot disclose the key information in the sensor nodes which have higher security level The analysis indicates that compared with existing approaches, this proposed scheme offers a stronger resilience against node capture attack

An Efficient Autonomous Key Management with Verifiable Secret Sharing Schemes for Reduced Communication/Computation Costs in MANET

A primary concern in mobile impromptu networks (MANETs) is security. Not like typical infrastructure based mostly wireless networks like, wireless cellular net-works, Mobile ad hoc Networks (MANET) contains speedily deployable, self organizing and self maintaining capability options. Moreover, they will be shaped on the fly as required. Additional issues for MANET’s security arise as a result of its high quality to its users. A number of key management schemes have been proposed for MANETs. Due to the disadvantages in Shamir secret sharing such as distribute erroneous sub shares based on this that message transmission communication cost is increased. To overcome this Verifiable secret sharing schemes are used here. Existing research in key management can only handle very limited number of nodes and are inefficient, insecure, or unreliable when the nodes increases. Here this paper modifies Autonomous key management scheme is proposed to address both for security and efficiency for key management in Mobile Ad hoc Network (MANET). It also reduces communication and computational cost in Ad-Hoc Network and works for large number of nodes

ECDH-based Scalable Distributed Key Management Scheme for Secure Group Communication

With the popularity of group-oriented applications, secure and efficient communication among all group members has become a major issue. An efficient key management mechanism is the base and critical technology of secure group communications. A distributed grouporiented key management scheme without the participation of third parties is proposed in the paper. The scheme deploys Elliptic Curve Diffie-Hellman (ECDH) which is more lightweight compared to regular Diffie-Hellman. The approach includes group key establishment and rekeying algorithms when there are membership changes. By using a distributed architecture, the load of key management is reduced. Specifically, the scheme can be extended to hybrid architecture to provide better scalability. Consequently, the extended scheme is both fault-tolerant and efficient in terms of integrity and confidentiality. In all protocol suites, the shared group key is calculated by scalar multiplication. According to performance comparisons with other schemes, the proposed scheme dramatically reduces communication overhead and computational costs. Security analysis indicates that the proposal provides a number of desirable security properties, including group key secrecy, forward secrecy and backward secrecy.

An efficient protocol for two‐party explicit authenticated key agreement

SummarySuccessful and efficient key management plays a critical role toward secured computing and communication systems. Many authenticated key agreement protocols have been proposed to meet the great challenges of information security. The two‐party key agreement protocol can be classified into two categories: implicit and explicit key authentications. This paper investigates the issue on authenticated two‐party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. The advantage of this explicit protocol is that it does not need any fixed public key infrastructure. Furthermore, this explicit protocol is provably secure in the random oracle under the Computation Gap Diffie‐Hellman assumption. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.

Secure and Energy-Efficient Join-Leave Operations in ZigBee Network

Since security plays an important role in several ZigBee applications, such as Smart Energy and medical sensor applications, ZigBee Specification includes various security mechanisms to protect ZigBee frames and infrastructure. Among them, the Join and Leave operations of ZigBee are investigated in this paper. The current Join-Leave operation is protected by the network key (a kind of group key). We claim it is not adequate to employ the network key for such purpose, and propose a new Join-Leave operation protected by the application link key (a kind of pairwise key), which is based on a more efficient key management scheme than that of ZigBee. Hence, the original Join operation consists of a total of 12 command frames, while the new Join operation consists of only 6 command frames. In particular, the security of the proposed Join-Leave operation is equivalent to or better than that of the original Join-Leave operation. The new Join-Leave operation is extensively analyzed in terms of security and efficiency, and compared with the original Join-Leave operation of ZigBee.