SearcharxivSearch

arXiv subjects

Akashdeep Bhardwaj

Publications and source records attributed to Akashdeep Bhardwaj.

4 recordsLinked to original sources

Enhancing Distributed Authorization With Lagrange Interpolation And Attribute-Based Encryption

In todays security landscape, every user wants to access large amounts of data with confidentiality and authorization. To maintain confidentiality, various researchers have proposed several techniques. However, to access secure data, researchers use access control lists to grant authentication and provide authorization. The above several steps will increase the server's computation overhead and response time. To cope with these two problems, we proposed multiparty execution on the server. In this paper, we introduce two different approaches. The first approach is encryption, utilizing the Involution Function Based Stream Cipher to encrypt the file data. The second approach is key distribution, using the Shamir secret sharing scheme to divide and distribute the symmetric key to every user. The decryption process required key reconstruction, which used second order Lagrange interpolation to reconstruct the secret keys from the hidden points. The process will reduce the server's computational overhead. The results are evaluated based on the encryption and decryption time, throughput, computational overhead, and security analysis. In the future, the proposed mechanism will be used to share large-scale, secure data within the organization.

cs.CR

Ransomware: A Rising Threat of new age Digital Extortion

This article attempts to discover the surreptitious features of ransomware and to address it in information systems security research. It intends to elicit attention with regard to ransomware, a newly emerged cyber threat using such encryption technology as RSA, and to help both academic researchers and IT practitioners understand the technological characteristics of ransomware, along with its severity analysis. As ransomware infections continue to rise and attacks employing refined algorithm become increasingly sophisticated, data protection faces serious challenges. The article discusses future trends and research directions related to ransomware, and provides prevention strategies for SMEs.

cs.CR

Three Tier Network Architecture to mitigate DDoS Attacks on Hybrid Cloud Environments

Connecting the wired and wireless networks particularly the Mobile ad hoc Network is interesting in real world situations due to its usefulness and practicality. Different mechanisms have been proposed to integrate MANETs and the Internet. These strategies differ in gateway discovery mechanism, cell switching criteria, ad hoc routing protocol.In this paper, Mobile-IP is integrated with Hierarchical Cluster-Head Gateway Switch Routing (CGSR) Protocol to provide Internet access to the mobile node of the ad hoc Network. This paper discusses a mechanism for selecting an alternate route in case if the Cluster Head is unable to forward the packets to the destination. The proposed framework provides bi-directional connectivity between the MANET and the Internet nodes. A detailed performance comparison is made between the proposed approach and the other three-tier strategies based on mobility of cluster heads and cluster gateways and other network parameters. The experimental results indicate that the proposed architecture has better packet delivery ratio, end-end delay and mobile node-gateway connectivity ratio for providing full bi-directional connectivity.

cs.NI

Security Algorithms for Cloud Computing Environment

In symmetric key cryptography the sender as well as the receiver possess a common key. Asymmetric key cryptography involves generation of two distinct keys which are used for encryption and decryption correspondingly. The sender converts the original message to cipher text using the public key while the receiver can decipher this using his private key. This is also called Public Key Cryptography. For every public key there can exist only one private key that can decipher the encrypted text. Security of RSA Algorithm can be compromised using mathematical attack, by guessing the factors of a large number. It may also be compromised if one can guess the private key. In accordance with the mathematical attack, we propose a secure algorithm in this paper. In this algorithm, we try to eliminate the distribution of n which is the large number whose factors if found compromises the RSA algorithm. We also present a comparative analysis of the proposed algorithm with the RSA algorithm.

cs.CR