Paper Title : SEPERABLE AND REVISIBLE DATA HIDING USING TRIPLE ENCRYPTION STANDARD IN CLOUD COMPUTING

ISSN : 2394-2231
Year of Publication : 2022

10.5281/zenodo.6530177

Authors: Mrs. K.E. Eswari, M.C.A., M.Phil., M.E., SET, S.Balaji

         



MLA Style: SEPERABLE AND REVISIBLE DATA HIDING USING TRIPLE ENCRYPTION STANDARD IN CLOUD COMPUTING "Mrs. K.E. Eswari, M.C.A., M.Phil., M.E., SET, S.Balaji" Volume 9 - Issue 3 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org

APA Style: SEPERABLE AND REVISIBLE DATA HIDING USING TRIPLE ENCRYPTION STANDARD IN CLOUD COMPUTING "Mrs. K.E. Eswari, M.C.A., M.Phil., M.E., SET, S.Balaji" Volume 9 - Issue 3 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org

Abstract
Wireless multimedia dispatches have developed fleetly with adding wireless access bandwidth and popular intelligent bias. In the decade, a number ofstudies have been conducted to design robust and effective schemes for delivering multimedia content over error-prone wireless networks. In discrepancy, veritably many of those studies have concentrated on the security aspect of similar transmission. There have been adding demands for the security of wireless multimedia Operations in recent times. Wireless networks when compared to traditional wired networks, are more likely prone to vicious attacks. Current security styles include physical layer and operation layer security technologies singly and independently. Generally, physical layer information is dynamic in wireless networks, and operation layer information is related to wireless multimedia content delivery; both have significant impact on security performance. This study proposes a common frame combining both the physical and operation layer security technologies. Specifically, by exercising the security capacity and signal processing technologies at the physical layer and the authentication and watermarking strategies at the operation layer, the available network coffers can be employed efficiently. Moreover, scalable multimedia security services could be maximized within given multimedia delivery deadlines. So, in particular, this common scheme could be enforced fluently with low communication above, which facilitates the deployment in large-scale wireless multimedia systems.

Reference
S. Kamara and K. Lauter, ‘‘Cryptographic cloud storage,’’ in Proc. Int. Conf. Financial Cryptogr. Data Secur., Berlin, Heidelberg,Jan.2010,pp.136–149 [2] J. Ousterhout, A. Gopalan, A. Gupta, A. Kejriwal, C. Lee, B. Montazeri, D. Ongaro, S. J. Park, H. Qin, M. Rosenblum, S. Rumble, R. Stutsman, and S. Yang, ‘‘The RAMCloud storage system,’’ ACM Trans. Comput. Syst., vol. 33, no. 3, pp. 1–55, Sep. 2015. [3] J. K. Resch and J. S. Plank, ‘‘AONT-RS: Blending Description data is found out. Also decoding occurs to get image data which contains original image with watermark data. Also dewatermarking is carried out, checked and raw image data is displayed if watermark to be correct. security and performance in dispersed storage systems,’’ in Proc. USENIX Conf. File Stroage Technol., Feb. 2011, pp. 191–202 [4] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. M. Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. In V. Shoup, editor, Advances in Cryptology – CRYPTO ’05, volume 3621 of Lecture Notes in Computer Science, pages 205–222. Springer, 2005. [5] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song. Provable data possession at untrusted stores. In P. Ning, S. De Capitani di Vimercati, and P. Syverson, editors, ACM Conference on Computer and Communication Security (CCS ’07). ACM Press, 2007. [6] G. Ateniese, S. Kamara, and J. Katz. Proofs of storage from homomorphic identification protocols. In To appear in Advances in Cryptology - ASIACRYPT ’09, Lecture Notes in Computer Science. Springer, 2009. [7] G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik. Scalable and efficient provable data possession. In Proceedings of the 4th international conference on Security and privacy in communication netowrks (SecureComm ’08), pages 1–10, New York, NY, USA, 2008. ACM. [8] J. Baek, R. Safavi-Naini, and W. Susilo. On the integration of public key data encryption and public key encryption with keyword search. In International Conference on Information Security (ISC ’06), volume 4176 of Lecture Notes in Computer Science. Springer, 2006. [9] J. Baek, R. Safavi-Naini, and W. Susilo. Public key encryption with keyword search revisited. In International conference on Computational Science and Its Applications, pages 1249–1259. Springer-Verlag, 2008.

Keywords
— Watermark Algorithm, Least Significant Bit, Image Processing, Content Delivery.