• Gagandeep Kaur

The incomplete theory suggest that in real world conditions, contracts cannot specify what is to be done in every possible contingency. A contact may be a simple economic tie up or maybe a contacts between multiple software components .Future contingencies may not even be describable when the contact or software is been build . Same is true, when a security frameworks are designed for Deduplication. Not all breaches in security structure of Deduplication System can be defined beforehand. However, the concept of provable security suggests that the adversary model and security model must be defined beforehand only then the security can be implemented. In this research work, we discuss how the axioms and postulates change and expand to satisfy new technical scenarios. As the expansion occurs the system can handle more security issues but at each stage there is a need to check the completeness, arithmetic soundness or arithmetic validity of the system in question. The computations of the checking the arithmetic validity and Proof of ownership schemes take some degree of overhead The work attempts to compute over head in computing the validity of provable security system of Deduplication in multiple Deduplication security scenario.

Deduplication, Encryption, Arithmetic validity, Proof of ownership, Key Generation, Cloud Computing

"Arithmetic Soundness of Deduplication Security Frameworks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.7, Issue 11, page no.450-455, November-2020, Available :http://www.jetir.org/papers/JETIR2011350.pdf

"Arithmetic Soundness of Deduplication Security Frameworks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 11, page no. pp450-455, November-2020, Available at : http://www.jetir.org/papers/JETIR2011350.pdf