Enhancing the Security and Performance of Cloud for E-Governance Infrastructure

E-Governance is getting momentous in India. Over the years, e-Governance has played a major part in every sphere of the economy. In this paper, we have proposed E-MODI (E-governance model for open distributed infrastructure) a centralized e-Governance system for government of India, the implementation of this system is technically based on open distributed infrastructure which comprises of various government bodies in one single centralized unit. Our proposed model identifies three different patterns of cloud computing which are DGC, SGC and CGC. In addition, readiness assessment of the services needs to migrate into cloud. In this paper, we propose energy efficient VM allocation algorithm to achieve higher energy efficiency in large scale cloud data centers when system on optimum mode. Our objectives have been explained in details and experiments were designed to demonstrate the robustness of the multi-layered security which is an integration of High secure lightweight block cipher CSL along with Ultra powerful BLAKE3 hashing function in order to maintain information security triad.

Multi-level authentication protocol for enabling secure communication in IoT

Internet of Things (IoT) is the domain of interest for the researchers at the present with the exponential growth in technology. Security in IoT is a prime factor, which highlights the need for authentication to tackle various attackers and hackers. Authentication is the process that uniquely identifies the incoming user and this paper develops an authentication protocol based on the chebyshev polynomial, hashing function, session password, and Encryption. The proposed authentication protocol is named as, proposed Elliptic, chebyshev, Session password, and Hash function (ECSH)-based multilevel authentication. For authenticating the incoming user, there are two phases, registration and authentication. In the registration phase, the user is registered with the server and Authentication center (AC), and the authentication follows, which is an eight-step criterion. The authentication is duly based on the scale factor of the user and server, session password, and verification messages. The authentication at the eight levels assures the security against various types of attacks and renders secure communication in IoT with minimal communication overhead and packet-loss. The performance of the method is analyzed using black-hole and Denial-of-service (DOS) attacks with 50 and 100 nodes in the simulation environment. The proposed ECSH-based multilevel authentication acquired the maximal detection rate, PDR, and QOS of 15.2%, 35.7895%, and 26.4623%, respectively in the presence of 50 nodes and DOS attacks, whereas the minimal delay of 135.922 ms is acquired in the presence of 100 nodes and DOS attacks.

PROLISEAN

The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive from this technology, such as medical or industrial applications. However, just like any other technology, security is a huge concern. Given its distributed architecture and its processing limitations, programmable matter cannot handle the traditional security protocols and encryption algorithms. This article proposes a new security protocol optimized and dedicated for IoT programmable matter. This protocol is based on lightweight cryptography and uses the same encryption protocol as a hashing function while keeping the distributed architecture in mind. The analysis and simulation results show the efficiency of the proposed method and that a supercomputer will need about 5.93 × 10 25 years to decrypt the message.

Data Deduplication System Based on Content-Defined Chunking Using Bytes Pair Frequency Occurrence

Every second, millions of data are being generated due to the use of emerging technologies. It is very challenging to store and handle such a large amount of data. Data deduplication is a solution for this problem. It is a new technique that eliminates duplicate data and stores only a single copy of data, reducing storage utilization and the cost of maintaining redundant data. Content-defined chunking (CDC) has been playing an important role in data deduplication systems due to its ability to detect high redundancy. In this paper, we focused on deduplication system optimization by tuning relevant factors in CDC to identify chunk cut-points and introduce an efficient fingerprint using a new hash function. We proposed a novel bytes frequency-based chunking (BFBC) algorithm and a new low-cost hashing function. To evaluate the efficiency of the proposed system, extensive experiments were done using two different datasets. In all experiments, the proposed system persistently outperformed the common CDC algorithms, achieving a better storage gain ratio and enhancing both chunking and hashing throughput. Practically, our experiments show that BFBC is 10 times faster than basic sliding window (BSW) and approximately three times faster than two thresholds two divisors (TTTD). The proposed triple hash function algorithm is five times faster than SHA1 and MD5 and achieves a better deduplication elimination ratio (DER) than other CDC algorithms. The symmetry of our work is based on the balance between the proposed system performance parameters and its reflection on the system efficiency compared to other deduplication systems.

A Study on the Optimization of Blockchain Hashing Algorithm Based on PRCA

Blockchain is widely used in encrypted currency, Internet of Things (IoT), supply chain finance, data sharing, and other fields. However, there are security problems in blockchains to varying degrees. As an important component of blockchain, hash function has relatively low computational efficiency. Therefore, this paper proposes a new scheme to optimize the blockchain hashing algorithm based on PRCA (Proactive Reconfigurable Computing Architecture). In order to improve the calculation performance of hashing function, the paper realizes the pipeline hashing algorithm and optimizes the efficiency of communication facilities and network data transmission by combining blockchains with mimic computers. Meanwhile, to ensure the security of data information, this paper chooses lightweight hashing algorithm to do multiple hashing and transforms the hash algorithm structure as well. The experimental results show that the scheme given in the paper not only improves the security of blockchains but also improves the efficiency of data processing.

Coverless VoIP Steganography Using Hash and Hash

Performing secure and robust embedding and extracting in real time voice streams without deteriorating the voice quality is a great challenge. This paper aims on hiding the secret data bits in the voice packets without modifying any data in the cover thereby improving the embedding transparency and becomes robust against the steganalysis attacks using coverless approach. Initially a hash array is built with the frame size. The cover bit position is identified from the hashing function. The hash array is marked with a flag value to indicate that the particular sample consist of the secret message bit. The hash array is attached with the VoIP samples, at the receiver side the hash table is separated, and the secret bits are extracted based on the hash array. The experimental results conducted on a VoIP prototype proved to be simpler and effective in terms of the computational complexity, undetectability and voice quality at both sender and receiver end.

A new adaptive XOR, hashing and encryption-based authentication protocol for secure transmission of the medical data in Internet of Things (IoT)

Internet of Things (IoT) plays a prominent role in health-care of patients, which assist the physicians and patients through the assistance in effective decision-making and additionally, in the medical field, IoT plays a significant role in real-time monitoring of the patients. Even though the data provided by the IoT devices ensure the effective decision-making, the data is susceptible to the network attacks. Thus, the paper proposes an authentication protocol for enabling the secure data transmission in IoT based on three functions, such as encryption function, hashing function, and adaptive XOR function. The proposed authentication protocol is named as, Adaptive XOR, hashing and Encryption Key Exchange (AXHE) protocol, which is the combination of the functions, such as encryption function, hashing function, and adaptive XOR function. The protocol ensures the security in the communication through two successive phases, such as registration and authentication of the user, where the user name, password, public keys, private keys, and security factor are employed. The authentication is progressed as seven levels and whenever the security factor matches, the user is authenticated and the communication continues. The analysis of the proposed AXHE is performed using 50 and 100 nodes in the presence of DOS and black hole attacks, which acquires the detection rate, throughput, and detection delay of 0.3859, 0.32, and 6.535 s, respectively.

PERANCANGAN APLIKASI CATALOG WISATA DI SUMATERA UTARA MENGGUNAKAN ALGORITMA RABIN-KARP

String matching is the process of finding all occurrences of a query or called a pattern into a string or text. String matching is a string or word matching that is used in the problem to find the pattern of string characters in a sentence. String matching is a technique in determining the accuracy of a given text pattern. Attractions in North Sumatra is one of the most popular tourist destinations in North Sumatra, Lake Toba because of the beautiful scenery of many outsiders or foreigners also visit the tour. Lack of information about North Sumatra tourism objects, the authors designed a tourism catalog to help the community in finding the latest attractions in North Sumatra such as natural attractions, historical tourism, religious tourism and many more can we visit the attractions around North Sumatra. The Rabin-Karp algorithm is a hashing function to find patterns in a string. In searching a travel catalog with the Rabin-Karp algorithm, it is very suitable to use because the Rabin-Krap algorithm is used to search for a word contained in a travel search. So that the testing phase requires eclipse software in the design of making travel catalogs.Keywords: String Matching, Attraction, Tourism Catalog, Rabin-Karp Algorithm, Eclipse