Securing Cloud: Elastic Key Management and Homomorphic Encryption

2014 ◽  
pp. 144-154
Author(s):  
Alexander W. Koehler
Keyword(s):  
Key Management ◽  
Homomorphic Encryption

An Implementation of Trusted Key Management Protocol (TKMP) in Wireless Network

2020 ◽  
Vol 17 (12) ◽  
pp. 5243-5249
Author(s):  
R. Jayaprakash ◽  
B. Radha
Keyword(s):  
Load Balancing ◽  
Wireless Network ◽  
Key Management ◽  
Secure Communication ◽  
Homomorphic Encryption ◽  
Selection Procedure ◽  
Communication Technologies ◽  
Path Selection ◽  
Management Protocol ◽  
Key Management Protocol

The Trusted Key Management Protocol (TKMP) provides one of the most secure communication technologies in MANET cluster-based data protection. For security reasons, TKMP is a trusted key that can be sent to all nodes in the communication cluster. This document introduces the Trusted Key Management Protocol (TKMP) feature to improve the quality of secure communications over a cluster-based wireless network. The proposed TKMP execution process includes CBPPRS (Cluster Based Privacy Preserving Routing Selection), LBCPR (Load Balancing Cluster Based Privacy Routing) and DLBPS (Dynamic Load Balancing Privacy Path Selection) procedure. To lock the data from the malicious node, the Paillier Cryptosystem (PC) encrypts packets with homomorphic encryption. The trust score makes it easier to update routing information and improves network throughput. The experimental results show that the proposed TKMP method works better than the other Trust-ECC method.

scholarly journals HCDA: Efficient Pairing-Free Homographic Key Management for Dynamic Cross-Domain Authentication in VANETs

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 1003 ◽  
Author(s):  
Haowen Tan ◽  
Shichang Xuan ◽  
Ilyong Chung
Keyword(s):  
Key Management ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Intelligent Transportation System ◽  
Homomorphic Encryption ◽  
Mutual Authentication ◽  
Time Interval ◽  
Short Time Interval ◽  
Driving Experience ◽  
Cross Domain

Emerging as the effective strategy of intelligent transportation system (ITS), vehicular ad hoc networks (VANETs) have the capacity of drastically improving the driving experience and road safety. In typical VANET scenarios, high mobility and volatility of vehicles result in dynamic topology of vehicular networks. That is, individual vehicle may pass through the effective domain of multiple neighboring road-side-units (RSUs) during a comparatively short time interval. Hence, efficient and low-latency cross-domain verification with all the successive RSUs is of significance. Recently, a lot of research on VANET authentication and key distribution was presented, while the critical cross-domain authentication (CDA) issue has not been properly addressed. Particularly, the existing CDA solutions mainly reply on the acquired confidential keying information from the neighboring entities (RSUs and vehicles), while too much trustworthiness is granted to the involved RSUs. Please note that the RSUs are distributively located and may be compromised or disabled by adversary, thus vital vehicle information may be revealed. Furthermore, frequent data interactions between RSUs and cloud server are always the major requisite so as to achieve mutual authentication with cross-domain vehicles, which leads to heavy bandwidth consumption and high latency. In this paper, we address the above VANET cross-domain authentication issue under the novel RSU edge networks assumption. Please note that RSUs are assumed to be semi-trustworthy entity in our design, where critical vehicular keying messages remain secrecy. Homomorphic encryption design is applied for all involved RSUs and vehicles. In this way, successive RSUs could efficiently verify the cross-domain vehicle with the transited certificate from the neighbor RSUs and vehicle itself, while the identity and secrets of each vehicle is hidden all the time. Afterwards, dynamic updating towards the anonymous vehicle identity is conducted upon validation, where conditional privacy preserving is available. Moreover, pairing-free mutual authentication method is used for efficiency consideration. Formal security analysis is given, proving that the HCDA mechanism yields desirable security properties on VANET cross domain authentication issue. Performance discussions demonstrate efficiency of the proposed HCDA scheme compared with the state-of-the-art.

scholarly journals Reliable AODV for DANET using Homomorphic Encryption Scheme

2019 ◽  
Vol 8 (4) ◽  
pp. 11529-11533
Keyword(s):  
Key Management ◽  
Homomorphic Encryption ◽  
Denial Of Service ◽  
Network Density ◽  
Encryption Scheme ◽  
Malicious Nodes ◽  
Critical Data ◽  
Authentication Mechanism ◽  
Management Scheme ◽  
Key Length

DANETs, when compared to MANETs, have high network density and mobility over time. To maintain a secure communication over DANET, requires the knowledge of mobility and complex key management scheme based on the topology change. Operation of DANETs can be categorized into two types based on the activity: 1. Activities requiring small key length 2. Activities requiring large key length. For disaster detection and emergency rescues, key length with reduced size (partial authentication mechanism) is preferable, whereas military operation or critical data sharing needs larger key size (complete authentication mechanism). The challenges for key management in DANETs include the identification of which routing information to be trusted, legitimate nodes with the key for conducting safety communication. Maintaining existing key management schemes over network density change leads to a complex routing and data handling methods.. In this paper we propose a novel approach of homomorphic encryption scheme for data communication security by combining network protocol steganographic security management scheme which reduces the critical information leakage in DANETs. The proposed algorithm helps to identify the distributed denial of service attack and identification of malicious nodes. The malicious activities in a group are identified by analysis of link failures, retransmission information encoded over application layers. In order to assure reliability, encoded data is used as a means to monitor, detect and remove malicious nodes from routing table. We conduct simulation experiments by using network simulator 3.26, Open street Map to verify that our method achieves significant improvement in preventing critical data leakage in presence of malicious nodes.

A Key Management Scheme for Smart Grid Wireless Terminals

2013 ◽  
Vol 442 ◽  
pp. 501-506
Author(s):  
Bo Zhang ◽  
Yu Fei Wang ◽  
Tao Zhang ◽  
Yuan Yuan Ma
Keyword(s):  
Smart Grid ◽  
Power Systems ◽  
Key Management ◽  
Large Scale ◽  
Homomorphic Encryption ◽  
Symmetric Polynomial ◽  
Encryption Algorithm ◽  
Fully Homomorphic Encryption ◽  
Management Scheme ◽  
Key Management Scheme

With the large-scale construction of smart grid, smart grid terminals widely using wireless access technology to communicate to the power systems. For ensuring the communication security, pair-wise key pre-distribution scheme is widely used, however, which introduces the complexity of key management, and insufficient security problems. According to the smart grid terminals wireless communication features, proposes an intelligent grid wireless terminal online key management scheme, which is based on the t rank binary symmetric polynomial and fully homomorphic encryption algorithm. This scheme make the communication key could be established with a few parameters between the communicating parties, which reduces the complexity of key predistribution and the amount of calculation. Moreover, the whole process of the key generation is encrypted by fully homomorphic encryption algorithm, effectively enhances the security of the scheme.

scholarly journals Compressible Multikey and Multi-Identity Fully Homomorphic Encryption

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Tongchen Shen ◽  
Fuqun Wang ◽  
Kefei Chen ◽  
Zhonghua Shen ◽  
Renjun Zhang
Keyword(s):  
Key Management ◽  
Homomorphic Encryption ◽  
Third Party ◽  
Secret Key ◽  
Fully Homomorphic Encryption ◽  
Expansion Technique ◽  
Public Keys ◽  
Learning With Errors ◽  
Computable Functions ◽  
Computing Models

With the development of new computing models such as cloud computing, user’s data are at the risk of being leaked. Fully homomorphic encryption (FHE) provides a possible way to fundamentally solve the problem. It enables a third party who does not know anything about the secret key and plaintexts to homomorphically perform any computable functions on the corresponding ciphertexts. In 2009, Gentry proposed the first FHE scheme. After that, its inefficiency has always been a bottleneck of the development of practical schemes and applications. At TCC 2019, Gentry and Halevi proposed the first compressible FHE scheme that enables the ratio of plaintext size to the ciphertext size (i.e., the compression rate) to reach 1 − ε for any small ε > 0 under the standard learning with errors (LWE) assumption. However, it is only a single-key one, where the homomorphic evaluation can only be performed over ciphertexts encrypted under the same key. Compared with single-key FHE, multikey FHE is more practical. Multikey FHE enables ciphertexts encrypted under different public keys to be homomorphically computed without having to decrypt these ciphertexts using their own private keys. In addition, in a multi-identity FHE scheme, only identity information and public parameters are required when encrypting, which simplifies certificate-based key management in public key infrastructure. In this paper, a new compressible ciphertext expansion technique is proposed. Then, we use this technique to construct a compressible multikey FHE scheme and a compressible multi-identity FHE scheme to overcome the bottleneck of bandwidth inefficiency in the multikey and multi-identity settings. The two schemes proposed in this paper make it possible that the objects of homomorphic operation can be the ciphertexts encrypted under different keys or different identities before compression, thus solving the single-key defect of the work of Gentry and Halevi.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Quantum Error Correction Code Scheme used for Homomorphic Encryption like Quantum Computation

2019 ◽  
Vol 19 (3) ◽  
pp. 61-70
Author(s):  
Il Kwon Sohn ◽  
◽  
Jonghyun Lee ◽  
Wonhyuk Lee ◽  
Woojin Seok ◽  
...  
Keyword(s):  
Error Correction ◽  
Quantum Computation ◽  
Homomorphic Encryption ◽  
Quantum Error Correction ◽  
Code Scheme ◽  
Error Correction Code ◽  
Quantum Error
Sign in / Sign up

Export Citation Format

Share Document