IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v3y2018i3idhcseit1833342.html

Secure Data Compression Scheme for Scalable Data in Dynamic Cloud Environments

Author

Listed:
  • B. Raja Rajeshwari
  • B. Sangeetha

Abstract

With the rapidly growing amounts of facts produced global, networked and multi-consumer storage systems have become very famous. However, worries over information safety still prevent many customers from migrating facts to far-flung garage. The conventional solution is to encrypt the information earlier than it leaves the owner’s premises. While sound from a safety angle, this method prevents the garage issuer from effectively making use of storage efficiency capabilities, which includes compression and deduplication, which could permit best utilization of the resources and consequently lower carrier fee. Client-aspect data deduplication particularly ensures that more than one uploads of the equal content handiest devour community bandwidth and garage area of a unmarried upload. A number of cloud backup providers as well as various cloud services actively use deduplication. Unfortunately, encrypted facts are pseudorandom and consequently cannot be deduplicated: therefore, cutting-edge schemes need to completely sacrifice both security and garage performance. In this paper, we present schemes that permit a greater quality-grained change-off in records chunk similarity. The instinct is that outsourced records may additionally require exceptional degrees of safety, relying on how popular it is miles content material shared through many users. Various deduplication schemes are analyze and provide experimental outcomes that suggest proposed cozy facts bite similarity provide improved effects in real time cloud environments.

Suggested Citation

  • B. Raja Rajeshwari & B. Sangeetha, 2018. "Secure Data Compression Scheme for Scalable Data in Dynamic Cloud Environments," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 3(3), pages 1784-1790, April.
  • Handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833342
    Note: Article URL: https://ijsrcseit.com/CSEIT1833342
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1833342
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT1833342.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833342. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.