P-MEC: Polynomial congruence based Multimedia Encryption technique over Cloud

Author(s):  
Rama Krishna ◽  
Krishan Kumar
Author(s):  
Shiguo Lian

In a wireless environment, multimedia transmission is often affected by the error rate; delaying; terminal’s power or bandwidth; and so forth, which brings difficulties to multimedia content protection. In the past decade, wireless multimedia protection technologies have been attracting more and more researchers. Among them, wireless multimedia encryption and watermarking are two typical topics. Wireless multimedia encryption protects multimedia content’s confidentiality in wireless networks, which emphasizes on improving the encryption efficiency and channel friendliness. Some means have been proposed, such as the format-independent encryption algorithms that are time efficient compared with traditional ciphers; the partial encryption algorithms that reduce the encrypted data volumes by leaving some information unchanged; the hardware-implemented algorithms that are more efficient than software based ones; the scalable encryption algorithms that are compliant with bandwidth changes; and the robust encryption algorithms that are compliant with error channels. Compared with wireless multimedia encryption, wireless multimedia watermarking is widely used in ownership protection, traitor tracing, content authentication, and so forth. To keep low cost, a mobile agent is used to partitioning some of the watermarking tasks. To counter transmission errors, some channel encoding methods are proposed to encode the watermark. To keep robust, some means are proposed to embed a watermark into media data of low bit rate. Based on both watermarking and encryption algorithms, some applications arise, such as secure multimedia sharing or secure multimedia distribution. In this chapter, the existing wireless multimedia encryption and watermarking algorithms are summarized according to the functionality and multimedia type; their performances are analyzed and compared; the related applications are presented; and some open issues are proposed.


Author(s):  
Shiguo Lian

Since the past decade, multimedia protection technologies have been attracting more and more researchers. Among them, multimedia encryption and watermarking are two typical ones. Multimedia encryptionen codes media data into an unintelligible form, which emphasizes on confidentiality protection. Multimedia watermarking embeds information into media data, which can be detected or extracted and used to authenticate the copyright. Traditionally, in multimedia distribution, media data are encrypted and then transmitted, while the copyright information is not considered. As an important application, to trace illegal distributors, the customer information (e.g., customer ID) is embedded into media data, which can trace illegal distributors. In this chapter, the multimedia distribution scheme based on watermarking technology is investigated, which realizes both confidentiality protection and copyright protection. Firstly, some related works, including multimedia encryption and digital watermarking, are introduced. Then, the existing watermarking-based distribution schemes are reviewed and analyzed. Furthermore, the novel scheme is proposed and evaluated. Finally, some open issues are presented.


Optik ◽  
2018 ◽  
Vol 168 ◽  
pp. 370-375 ◽  
Author(s):  
Motilal Singh Khoirom ◽  
Dolendro Singh Laiphrakpam ◽  
Tuithung Themrichon

2017 ◽  
Vol 15 (7) ◽  
pp. 1301-1305
Author(s):  
F. M. Barbosa ◽  
A. R. S. F. Vidal ◽  
H. L. S. Almeida ◽  
F. L. de Mello

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
M. Khalid Mahmood ◽  
Farooq Ahmad

In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruencemod pto polynomial congruencemod pk. For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the formaxn≡b(mod pk),k≥1,wherea,b,andn>0are integers which are not divisible by an odd primep. It is shown that the algorithms suggested in this paper drastically reduce the complexity for such computations to a logarithmic scale. The efficacy of the proposed technique for solving negative exponent equations of the formax-n≡b(mod pk)has also been addressed.


2016 ◽  
Vol 79 ◽  
pp. 293-298 ◽  
Author(s):  
Sridhar C. Iyer ◽  
R.R. Sedamkar ◽  
Shiwani Gupta

Author(s):  
Amit Pande ◽  
Joseph Zambreno

Sign in / Sign up

Export Citation Format

Share Document