z-logo
open-access-imgOpen Access
Encryption to Decryption Statistics for Secure Data with Independent Servers for Deduplication
Author(s) -
Mohd Akbar,
K. E. Balachandrudu,
Prasadu Peddi
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1068.109119
Subject(s) - data deduplication , computer science , server , encryption , database , computer security , client side encryption , computer network , on the fly encryption
Encoding information on the customer side before transferring it to distributed storage is fundamental for ensuring clients’ protection. Anyway customer side encryption is inconsistent with the standard routine with regards to deduplication in distributed storage administrations. Deduplication of records on the capacity servers has been very much clarified on different arrangements which utilized autonomous servers. An answer has been proposed considering customer side encryption and server side deduplication and guaranteeing security while utilizing a solitary server for the entire procedure. This arrangement was tended to at record level and had the thought to actualize square level deduplication utilizing a similar deduplication convention. We examined the odds of executing square level deduplication considering the single server record level deduplication plan of the base convention. We executed and examined this situation and played out an unpleasant examination with the record level deduplication by recreation. Both the plans appeared to be similar. We exhibit that our plan gives preferable security ensures over past efforts. We present the main secure cross-client deduplication plot that supports customer side encryption without requiring any extra autonomous servers. Curiously, the plan depends on utilizing a PAKE (secret word confirmed key trade) convention.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here