https://cyberleninka.org/article/n/915923.pdf

Improvised Apriori Algorithm Using Frequent Pattern Tree for Real Time Applications in Data Mining

Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

Cloud computing is a rising technology that is still unclear to many security issues. The most challenging issue today in cloud servers is to ensure data security and privacy of the users. The proposed schema presents HE-RSA or hybrid encryption RSA along with Advanced Encryption Standard or AES to ensure efficiency, consistency and trustworthiness in cloud servers. The goal of this paper is to use various cryptography concepts during communication along with its application in cloud computing and to enhance the security of ciphertext or encrypted data in cloud servers along with minimizing the consumption of time, cost and memory size during encryption and decryption.

Secure algorithm for cloud computing and its applications

Cloud Computing is a rising field in the history of computing. It is a way to maximise the capacity and capabilities without spending a lot to buy a new infrastructure and software. When users are online, they can get faster access to their data due to the massive storage. Although Cloud computing has many advantages due to large number of organizations moving towards it, it comes up with lots of security issues and breaches faced by both cloud service providers and users which are addressed in this paper. An efficient framework is devised for dealing with such issues. Proposed framework can protect data while transferring, sharing and storing in data centers using classification of data, Hashed Message Authentication codes and Index Building. The data is divided into three sections and accordingly the user is asked for authentication. User is provided the digital signature which can be verified with cloud directory. Using indexing, search can be made on the encrypted data.

A framework for data security and storage in Cloud Computing

Cloud computing is a developing technology that is yet unclear to many security issues. Data in the untrusted clouds can be encrypted using encryption algorithm. Randomizing this data provides more security which can be achieved by padding concept in the cloud. In this paper, the user's data is encrypted using padding scheme, called Optimal Asymmetric Encryption Padding (OAEP) together with Hybrid Encryption algorithm that is based on RSA (i.e., HE-RSA), in order to allow multiple parties to compute a function on their inputs while preserving Integrity and Confidentiality. The Homomorphic Encryption(HE) is performed on the encrypted data without decrypting it in computationally powerful clouds and the Secure Multi-Party Computation (SMPC) can be used in the cloud to ensure security and privacy of the users. In this paper, we have proposed a scheme that integrates the multi-party computation with homomorphic encryption to allow calculations of encrypted data without decryption. The cryptographic techniques used in our cloud model are described and the overheads are compared with Homomorphic Encryption and Multi-Party Computation.

Secure cloud computing algorithm using homomorphic encryption and multi-party computation

Geographic routing scheme (such as Greedy perimeter stateless routing) makes use of location information to forward packets greedily Nodes need to keep only this location information in stateless routing When the greedy forwarding fails, routing switches to perimeter forwarding based on either planar graph (GG and RNG) or cross link detection protocol approaches However, it has drawback in terms of cost and computational overheads We propose a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails We prove that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2) We also show that coverage-tree based geographic routing problem is APX hard and not approximable with a factor of $$1/2(1-\in ) \ln n$$1/2(1-?)lnn for any fixed $$\in > 0$$?>0 unless $$NP\subseteq DTIME(n^{\log \log n})$$NP⊆DTIME(nloglogn) Our proposed scheme of coverage-tree heuristics based geographic routing is $$(1+\ln m)$$(1+lnm)-approximation algorithm, a polynomial time algorithm using minimum distance topology knowledge On performance comparison using simulation, our proposed scheme outperforms with the competitive schemes in term of success rate, network overhead and success rate against varying node density

Anurag Raj

Papers

Approximating geographic routing using coverage tree heuristics for wireless network