My Account | Careers | Downloads | Blog

ABSTRACT:

Secret sharing and erasure coding-primarily based approaches are utilized in distributed storage systems to ensure the confidentiality, integrity, and availability of vital data. To achieve performance goals in knowledge accesses, these knowledge fragmentation approaches can be combined with dynamic replication. In this paper, we have a tendency to think about data partitioning (each secret sharing and erasure coding) and dynamic replication in knowledge grids, in which security and information access performance are essential problems. More specifically, we investigate the problem of optimal allocation of sensitive information objects that are partitioned by using secret sharing theme or erasure coding scheme and/or replicated. The grid topology we take into account consists of 2 layers. In the higher layer, multiple clusters form a network topology that can be represented by a general graph. The topology at intervals every cluster is represented by a tree graph. We have a tendency to decompose the share duplicate allocation problem into two sub issues: the optimal inter cluster resident set drawback (OIRSP) that determines which clusters need share replicas and the optimal intra cluster share allocation problem (OISAP) that determines the number of share replicas required in a very cluster and their placements. We tend to develop 2 heuristic algorithms for the 2 sub issues. Experimental studies show that the heuristic algorithms achieve sensible performance in reducing Communication value and are close to optimal solutions.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Fast and Secure Distributed Nonnegative Matrix Factorization ABSTRACT: The nonnegative matrix factorization (NMF) technique has been utilized effectively in a number of different data mining activities. Because
PROJECT TITLE : ESVSSE Enabling Efficient, Secure, Verifiable Searchable Symmetric Encryption ABSTRACT: It is believed that symmetric searchable encryption, also known as SSE, will solve the problem of privacy in data outsourcing
PROJECT TITLE : Secure Cloud Data Deduplication with Efficient Re-encryption ABSTRACT: The data deduplication technique has seen widespread adoption among commercial cloud storage providers, which is both important and necessary
PROJECT TITLE : Novel Secure Outsourcing of Modular Inversion for Arbitrary and Variable Modulus ABSTRACT: In the fields of cryptography and algorithmic number theory, modular inversion is regarded as one of the operations that
PROJECT TITLE : Forward Secure Public Key Encryption with Keyword Search for Outsourced Cloud Storage ABSTRACT: Cloud storage has become a primary industry in remote data management services, but it also attracts security concerns.

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry