2013
5
1
1
0
A survey on digital data hiding schemes: principals, algorithms, and applications
2
2
This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, or video and the final receiver, which is Human Auditory System (HAS) or Human Visual System (HVS), is also beneficial. For the speech/audio case, HAS will be briefly reviewed to find out how to make the most of its weaknesses for embedding as much data as possible. The same discussion also holds for the image watermarking. Although several audio and image data hiding schemes have been proposed so far, they can be divided into a few categories. Hence, conventional schemes along with their recently published extensions are introduced. Besides, a general comparison is made among these methods leading researchers/designers to choose the appropriate schemes based on their applications. Regarding the old scenario of the prisonerwarden and the evil intention of the warden to eavesdrop and/or destroy the data that Alice sends to Bob, there are both intentional and unintentional attacks to digital information hiding systems, which have the same effect based on our definition. These attacks can also be considered for testing the performance or benchmarking, of the watermarking algorithm. They are also known as steganalysis methods which will be discussed at the end of the paper.
1

5
36


M. A.
Akhaee
Iran
akhaee@ut.ac.ir


F.
Marvasti
Iran
marvasti@sharif.edu
Data hiding
Watermarking
Capacity
Robustness
Security
Steganalysis
[ [1] C. S. Lu, Multimedia security: steganography and digital watermarking techniques for protection of intellectual property, Idea Group Publishing, 2004. ##[2] J. Seitz, Digital watermarking for digital media, Information Science Publishing, 2005. ##[3] G. C. Langelaar, I. Setyawan, and R.L. Lagendijk, Watermarking digital image and video data: A stateoftheart overview, IEEE Trans. Signal Process. Magazine, vol. 17, no. 5, pp. 2046, 2000. ##[4] S. Katzenbeisser, and F. A. Petitcolas, Information hiding techniques for steganography and digital watermarking, Artech House, Boston, 2000. ##[5] I. J. Cox, M. L. Miller, and J. A. Bloom,. Digital watermarking, first edition, San Francisco: Morgan Kaufmann, 2002. ##[6] M. Barni and F. Bartolini, Watermarking systems engineering: Enabling Digital Assets Security and Other Applications, CRC, 2008. ##[7] A. B. Watson, Handbook of human perception and performance, in Temporal Sensitivity, K. Boff, L. Kaufmann, and J. Thomas, Eds. New York: Wiley, 1986. ##[8] A. B. Watson, M. Taylor, and R. Borthwick, Image quality and entropy masking, Proc. SPIE, Human Vision, Visual Processing, and Digital Display VIII, 1997, vol. 3016, pp. 212. ##[9] A. B. Watson, J. Y. Yang, J. A. Solomon, and J. Villasenor, Visibility of wavelet quantization noise, IEEE Trans. on Image Process., vol. 6, no. 8, pp. 11641175, Oct. 1997. ##[10] J. R. Deller, J. H. L. Hansen, and J. G. Proakis, Discrete Time Processing of Speech Signals, 2nd edition, IEEE Press, 2000. ##[11] SQAM  Sound Quality Assessment Material, http://sound.media.mit.edu/mpeg4/audio/sqam/,2006. ##[12] K. Brandenburg, T. Sporer, NMR and masking flag: Evaluation of quality using perceptual criteria, Proceedings of the International Audio Engineering Society Conference on Audio Test and Measurement, pp.169179, Sept, 1992. ##[13] Z. Wang, and A. C. Bovik, Image quality assessment: from error visibility to structural similarity, IEEE Trans. on Image Process., vol. 13, no. 4, pp. 600612, 2004. ##[14] Z. Wang, and A. C. Bovik, A universal image quality index, IEEE Signal Processing Letters, vol. 9,no.3,pp.8184,2002. ##[15] P. Kabal, An Examination and Interpretation of ITUR BS.1387: Perceptual evaluation of audio quality, Technical Report of Telecom. Signal Process. Lab., version 2, (http://www.tsp.ece.mcgill.ca/), McGill University, 2003. ##[16] Q. Cheng, and T. S. Huang, Robust optimum detection of transform domain multiplicative watermarks, IEEE Trans. Signal Processing, vol. 51, no. 4, pp. 906924, 2003. ##[17] S. Wu, J. Huang, D. Huang, Y. Q. Shi, Efficiently selfsynchronized audio watermarking for assured audio data, IEEE Transmissions on Broadcast., vol.51, no. 1, pp. 6976, Mar. 2005. ##[18] E. T. Lin and E. J. Delp, A review of fragile image watermarks, Proc. Multimedia and Security Workshop on Multimedia Contents, Orlando, pp. 2529, Oct. 1999. ##[19] L. M. Marvel, G. W. Hartwig, and C. Boncelet, Compression compatible fragile and semi fragile tamper detection, Proc. SPIE, vol. 39, no 71, 131139 ,2002. ##[20] O. Ekici, B. Sankur, B. Coskun, U. Naci, M. Akcay, Comparative assessment of semi fragile watermarking methods, Journal of Electronic Imaging, vol. 13, no. 1, pp. 209216, Jan. 2004. ##[21] C. Lu and H. M. Liao, Multipurpose watermarking for image authentication and protection, IEEE Trans. Image Process., vol. 10, no. 10, pp.15791592, Oct., 2001. ##[22] J. Fridrich, Security of fragile authentication watermarks with localization, Proc. SPIE, vol. 46, no. 75, 691700, 2002. ##[23] G. W. Yu, C. S. Lu, and H. Y. M. Liao, Mean quantizationbased fragile watermarking for image authentication, Opt. Eng. vol. 40, no. 7, 13961408, 2004. ##[24] H. Yuan, and X. P. Zhang, Multiscale fragile watermarking based on the Gaussian mixture model, IEEE Trans. on Image Process., vol. 15, no. 10, pp. 31893200, Oct. 2006. ##[25] E. T. Lin, C. I. Podilchuk, and E. J. Delp, Detection of image alterations using semifragile watermarks, Proc. SPIE, vol. 39, no. 71, pp. 152163, 2000. ##[26] Z. M. Lu, C. H. Liu, D. G. Xu, and S. H. Sun, Semifragile image watermarking method based on index constrained vector quantization, Electronic Letter, vol. 39, no. 7, pp. 3536. Jan. 2003. ##[27] D. Zou, Y. Q. Shi, Z. Ni, and W. Su, A semifragile lossless digital watermarking scheme, IEEE Trans. on Circuit and Systems for Video Tech., vol. 16, no. 10, pp. 12941300, Oct. 2006. ##[28] J. Chou, K. Ramchandran, and A. Ortega, High capacity audio data hiding for noisy channels, Proc. of the International Conference on Information Technology: Coding and Computing, pp.108111, 2001. ##[29] K. Hofbauer and G. Kubin, Highrate data embedding in unvoiced speech, Proc. International Conference on Spoken Language Processing, pp.176180, 2006. ##[30] D. C. Wu and W. H. Tsai, A steganographic method for images by pixelvalue differencing, Pattern Recognition Letters, vol. 24, no. 910, pp.1613  1626, 2003. ##[31] X. Zhang and S. Wang, Vulnerability of pixel value differencing steganography to histogram analysis and modification for enhanced security, Pattern Recognition Letters, vol. 25, no. 3, pp.331  339, 2004. ##[32] C. H. Yang, C. Y. Weng, S. J. Wang, and H.M. Sun, Adaptive data hiding in edge areas of images with spatial lsb domain systems, IEEE Trans. on Info. Forensics and Security, vol. 3, no. 3, pp. 488 497, Sept. 2008. ##[33] H. C.Wu, N. I.Wu, C. S. Tsai, and M. S. Hwang, Image steganographic scheme based on pixelvalue differencing and lsb replacement methods, Vision, Image and Signal Processing, IEE Proc., vol. 152, no. 5, pp. 611 615, Oct. 2005. ##[34] H. Hering and M. Hagmuller, Safety and security increase for air traffic management through unnoticeable watermark aircraft identification tag transmitted with the VHF voice communication, Proc. of International Conference on Digital Avionic Systems, pp. 202  206, 2003. ##[35] J. Mielikainen, LSB Matching Revisited, IEEE Signal Processing Letters, vol. 13, no. 5., May, 2006. ##[36] S. Sarreshtedari, M. Ghotbi, and S. Ghaemmaghami, Onethird probability embedding: Less detectable LSB steganography, Proc. of International Conference on Multimedia and Expo (ICME), pp. 10021005, 2009. ##[37] X. Li, B. Yang, D. Cheng, and T. Zeng, A generalization of lsb matching, Signal Processing Letters, IEEE, vol. 16, no. 2, Feb. 2009. ##[38] N. Khademikalantari, M. A. Akhaee, and S. M. Ahadi, and S. M. R. Amindavar, Robust multiplicative patchwork method for audio watermarking, IEEE Trans. on Audio, Speech, and Language Processing, vol. 17, no. 6, pp. 11331141, 2009. ##[39] A. Westfeld, F5A Steganographic algorithm, in Lecture Notes in Computer Science. Springer, 2001, vol. 2137, pp. 289302. ##[40] J. Fridrich, T. Pevny, and J. Kodovsky, Statistically undetectable JPEG steganography: dead ends challenges, and opportunities, Proc. of 9th workshop on Multimedia & security, New York, NY, USA: ACM, 2007, pp. 314. ##[41] J. Fridrich and M. Goljan, Images with selfcorrecting capabilities, Proc. of International Conference on Image Processing, vol. 3, pp. 792796, 1999. ##[42] H. J. He, J. S. Zhang, and F. Chen, Adjacentblock based statistical detection method for selfembedding watermarking techniques, Signal Processing, vol. 89, no. 8, pp. 1557  1566, 2009. ##[43] S. H. Liu, H. X. Yao, W. Gao, and Y.L. Liu, An image fragile watermark scheme based on chaotic image pattern and pixelpairs, Applied Mathematics and Computation, vol. 185, no. 2, pp. 869882, 2007. ##[44] V. Mall, K. Bhatt, S. Mitra, and A. Roy, Exposing structural tampering in digital images, Proc. International Conference Signal Processing, Computing and Control (ISPCC), pp. 16.2012. ##[45] R. Chamlawi, A. Khan, and I. Usman, Authentication and recovery of images using multiple watermarks, Computers and Electrical Engineering, vol. 36, no. 3, pp. 578  584, 2010. ##[46] C. W. Yang and J. J. Shen, Recover the tampered image based on vq indexing, Signal Processing, vol. 90, no. 1, pp. 331  343, 2010. ##[47] A. Cheddad, J. Condell, K. Curran, and P. M. Kevitt, A secure and improved selfembedding algorithm to combat digital document forgery, Signal Processing, vol. 89, no. 12, pp. 2324  2332,2009. ##[48] X. Zhang and S. Wang, Statistical fragile watermarking capable of locating individual tampered pixels, Signal Processing Letters, IEEE, vol. 14, no. 10, pp. 727730, 2007. ##[49] X. Zhang and S. Wang, Fragile watermarking with errorfree restoration capability, IEEE Transactions on Multimedia, vol. 10, no. 8, pp.14901499, 2008. ##[50] X. Zhang and S. Wang, Fragile watermarking scheme using a hierarchical mechanism, Signal Processing, vol. 89, no. 4, pp. 675  679, 2009. ##[51] X. Zhang, S. Wang, and G. Feng, Fragile watermarking scheme with extensive content restoration capability, in Digital Watermarking, ser. Lecture Notes in Computer Science. Springer Berlin Heidelberg, vol. 5703, pp. 268278. 2009. ##[52] X. Zhang, S. Wang, Z. Qian, and G. Feng, Self embedding watermark with flexible restoration quality, Multimedia Tools and Applications, vol. 54, no. 2, pp. 385395, 2011. ##[53] Z. Qian, G. Feng, X. Zhang, and S. Wang, Image selfembedding with highquality restoration capability, Digital Signal Processing, vol. 21, no.2, pp. 278  286, 2011. ##[54] P. Korus and A. Dziech, A novel approach to adaptive image authentication, Proc. International Conference on Image Processing (ICIP), pp. 27652768. 2011. ##[55] X. Zhang, Z. Qian, Y. Ren, and G. Feng, Watermarking with flexible selfrecovery quality based on compressive sensing and composite re construction, IEEE Transactions on Information Forensics and Security, vol. 6, no. 4, pp. 12231232, 2011. ##[56] P. Korus and A. Dziech, Efficient method for con tent reconstruction with selfembedding, IEEE Transactions on Image Processing, vol. 22, no. 3, pp. 11341147, 2013. ##[57] D. J. C. MacKay, Fountain codes, Communications, IEE Proceedings, vol. 152, no. 6, pp. 10621068, 2005. ##[58] S. Sarreshtedari, M. Akhaee, On source channel coding for image tampering protection and self recovery, submitted to IEEE Transactions on Image Processing, 2013. ##[59] A. Said and W. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees, IEEE Transactions on Circuits and Systems for Video Technology, vol. 6, no. 3, pp. 243250, 1996. ##[60] S. B. Wicker, ReedSolomon Codes and Their Applications. Piscataway, NJ, USA: IEEE Press, 1994. ##[61] J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications, 1st Edition, Cambridge University Press, NY, 2010. ##[62] M. Parvaix, L. Girin, Informed Source Separation of Linear Instantaneous UnderDetermined Audio Mixtures by Source Index Embedding, IEEE Transactions on Audio, Speech, and Language Processing, vol.19, no.6, pp.1721,1733, Aug. 2011. ##[63] P. H. W. Wong, O. C. Au, A capacity estimation technique for JPEGtoJPEG image watermarking, IEEE Transactions on Circuits and Systems for Video Technology, vol.13, no.8, pp.746,752, Aug. 2003. ##[64] E. Zwicker and H. Fastl, Psychoacoustics: Facts and models, 2nd edition, SpringerVerlag, 1999. ##[65] V. Schyndel, R. G., A. Z. Tirkel, and C. F. Osborne, A digital watermark, International Conference on Image Processing (ICIP), Austin, pp. 8690. 1994. ##[66] R. Crandall, Some Notes on Steganography, posted on Steganography Mailing List. 1998. ##[67] A. Westfeld and A. Pfitzmann, Attacks on steganographic systems, in Proc. 3rd Int. Work shop on Information Hiding, vol. 1768, pp. 6176. 1999. ##[68] J. Fridrich, M. Goljan, and R. Du, Detecting lsb steganography in color, and grayscale images, IEEE, Multimedia, vol. 8, no. 4, pp. 2228, Oct. 2001. ##[69] A. Latham, JPEG Hide and Seek. 1999. Available: linux01.gwdg.de/alatham/stego. ##[70] N. Provos, Outguess. [Online]. Available: www.outguess.org. ##[71] J. Fridrich, M. Goljan, and D. Soukal, Perturbed quantization steganography, Multimedia Syst., vol. 11, no. 2, pp. 98107, Dec. 2005. ##[72] K. S. Wong, X. Qi, and K. Tanaka, A DCTbased Mod4 steganographic method, Signal Processing, vol. 87, pp. 12511263, 2007. ##[73] C. K. Chan and L. Cheng, Hiding data in images by simple lsb substitution, Pattern Recognition, vol. 37, no. 3, pp. 469  474, 2004. ##[74] C. H. Yang, Inverted pattern approach to improve image quality of information hiding by lsb substitution, Pattern Recognition, vol. 41, no. 8, pp. 2674  2683, 2008. ##[75] X. Zhang and S. Wang, Efficient steganographic embedding by exploiting modification direction, Communications Lett., IEEE, vol. 10, no. 11, pp. ##781 783, Nov. 2006. ##[76] R. M. Chao, H. C. Wu, C. C. Lee, and Y. P. Chu, A novel image data hiding scheme with diamond encoding, EURASIP J. Inf. Security, vol. 4, 2009. ##[77] W. Hong and T. S. Chen, A novel data embedding method using adaptive pixel pair matching, IEEE Trans. on Info. Forensics and Security, vol. 7, no. 1, pp. 176 184, Feb. 2012. ##[78] C. F. Lee, C. C. Chang, and K. H. Wang, An improvement of EMD embedding method for large payloads by pixel segmentation strategy, Image and Vision Computing, vol. 26, no. 12, pp. 1670  1676, 2008. ##[79] W. Hong, T. S. Chen, and C. W. Shiu, A minimal Euclidean distance searching technique for sudoku steganography, in International Symposium Info. Science and Engineering, vol. 1, pp. 515 518. 2008. ##[80] J. Wang, Y. Sun, H. Xu, K. Chen, H. J. Kim, and S. H. Joo, An improved sectionwise exploiting modification direction method, Signal Processing, vol. 90, no. 11, pp. 2954  2964, 2010. ##[81] B. Chen and G. Wornell, Quantization index modulation: A class of provably good methods for digital watermarking and information embed ding, IEEE Trans. Inf. Theory, vol. 47, no. 4, pp. 14231443, May 2001. ##[82] T. H. Lan, A. H. Tewfik, A novel highcapacity dataembedding system, IEEE Trans. On Image Process., vol. 15, no. 8, , pp. 24312440, Aug. 2006. ##[83] J. J. Eggers, R. Buml, R. Tzschoppe, and B. Girod, Scalar costa scheme for information embedding, IEEE Trans. Signal Process., vol. 4, no. 51, pp. 10031019, Apr. 2003. ##[84] R. Zamir, S. Shamai, and U. Erez, Nested linear/lattice codes for structured multiterminal binning, IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 12501276, Jul. 2002. ##[85] J. J. Eggers, J. K. Su, B. Girod, A blind watermarking scheme based on structured codebooks, In Secure Images and Image Authentication, Proc. IEE Colloquium, pp. 4/14/6, Lon don, UK, Apr. 2000. ##[86] Q. Zhang, and N. Boston, Quantization index modulation using E8 lattice, Proc. of 41th Annual Allerton Conf. on Communication, Control and Computing, Allerton, IL, USA, 2003. ##[87] R. Fischer, R. Tzschoppe, and R. Buhamel, Lattice costa schemes using subspace projection for digital watermarking, European Trans. Telecommunications, vol. 15, no. 4, pp. 51362, Aug. 2004. ##[88] A. Abrardo and M. Barni, Informed watermarking by means of orthogonal and quasiorthogonal dirty paper coding, IEEE Trans. Signal Processing, vol. 53, no. 2, pp. 824833, 2005. ##[89] M. A. Akhaee, M. J. Saberian, S. Feizi, and F. Marvasti, Robust audio data hiding using correlated quantization with histogram based detector, IEEE Trans. on Multimedia, vol. 11, no. 5, pp. 834842, Aug. 2009. ##[90] J. J. Eggers, R. Buml, and B. Girod, Estimation of amplitude modifications before SCS watermark detection, Proc. SPIE Security Watermarking Multimedia Contents, vol. 46 no. 75, pp. 387398, Jan. 2002. ##[91] M. L. Miller, G. J. Doerr, and I. J. Cox, Applying informed coding and embedding to design a robust high capacity watermark, IEEE Trans. Image Process., vol. 13, no. 6, pp. 792807, Jun. 2004. ##[92] F. PerzGonzalez, C. Mosquera, M. Barni, and A. Abrado, Rational dither modulation: A high rate datahiding method invariant to gain attacks, IEEE Trans. Signal Process., vol. 53, no. 10, pp. 39603975, Oct. 2005. ##[93] A. Abrardo, M. Barni, F. PerezGonzallez and C. Mosquera, Improving the performance of RDM watermarking by means of trellis coded quantization, IEE Proc. Inf. Security, vol. 153, no. 3, pp. 107114, Sept. 2006. ##[94] P. Guccione, M. Scagliola, Hyperbolic RDM for nonlinear volumetric distortions, IEEE Trans. Inf. Forensics and Security, vol. 4, no. 2, pp. 2535, March 2009. ##[95] F. PerzGonzalez, C. Mosquera, Quantizationbased data hiding robust to lineartimeinvariant filtering, IEEE Trans. Inf. Forensics Security, vol. 3, no. 2, pp. 137152, June 2008. ##[96] M. A. Akhaee, A. Amini, G. Ghorbani, and F. Marvasti, A solution to gain attack on water marking systems: Logarithmic homogeneous rational dither modulation, Proc. of International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 13121316, 2010. ##[97] P. Comesaa and F. PerezGonalez, Dither modulation in the logarithmic domain, Proc. of International Workshop in Digital Watermarking (IWDW’07), Guangzhou, China, Dec. 2007. ##[98] P. Comesata and F. PerezGonzalez, On a watermarking scheme in the logarithmic domain and its perceptual advantages, Proc. of International Conference on Image Processing (ICIP’07), pp. 20362039, 2007. ##[99] U. Erez and R. Zamir, Achieving (1=2log(1+SNR) on the AWGN channel with lattice encoding and decoding, IEEE Trans. on Inf. Theory, vol. 50, no. 10, pp. 22932314, Oct. 2004. ##[100] P. Moulin and R. Koetter, Datahiding codes, IEEE Trans. on Signal Process., vol. 93, no. 12, pp. 20812127, Dec. 2005. ##[101] R. Tzschoppe, R. Bahml, R. Fischer, A. Kaup, and J. Huber, Additive nonGaussian attacks on the scalar costa scheme, in Proc. SPIE, San Jose, CA, Jan. 2005. ##[102] P. Moulin, and A. K. Goteti, Block QIM watermarking games, IEEE Trans. on Inf. Forensics and Security, vol. 1, no. 3, pp. 293310, Sept. 2006. ##[103] N. K. Kalantari, S. M. Ahadi, A logarithmic quantization index modulation for perceptually better data hiding, Image Processing, IEEE Transactions on, vol. 19, no. 6, pp. 1504,1517, June 2010. ##[104] W. Bender, D. Gruhl, N. Morimoto, and A. Lu, Techniques for data hiding, IBM Systems, vol. 35, no. 3, pp. 313336, 1996. ##[105] M. Arnold, Audio watermarking: Features, applications and algorithms, IEEE International Conference Multimedia and Expo, vol. 2, pp. 10131016, 2008. ##[106] I. K. Yeo and H. J. Kim, Modified patchwork algorithm: A novel audio watermarking scheme, IEEE Trans. on Speech, Audio, and Language Process., vol. 11, no. 4, pp. 381386, Jul. 2003. ##[107] I. K. Yeo, H. J. Kim Generalized patchwork algorithm for image watermarking, Multimedia Systems, vol. 9, no. 3, pp. 261265, 2003. ##[108] H. Malik, R. Ansari, and A. Khokhar, Robust data hiding in audio using allpass filters, IEEE Trans. on Audio, Speech, and Language Process., vol. 15, no. 4, pp. 12961304, May 2007. ##[109] A. Takahashi, R. Nishimura, Y. Suzuki, Multiple watermarks for stereo audio signals using phasemodulation techniques, IEEE Trans. on Signal Process., vol. 53, no. 2 , pp. 806815, Feb. 2005. ##[110] D. Gruhl and W. Bender, Echo hiding, Proc. of Information Hiding Workshop, pp. 295315, 1996. ##[111] H. O. Oh, J. W. Seok, J. W. Hong, and D. H. Youn, New echo embedding technique for robust and imperceptible audio watermarking, Proc. of International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 20112014, 2001. ##[112] C. Xu, J. Wu, Q. Sun, and K. Xin, Applications of digital watermarking technology in audio signals, J. Audio Eng. Soc., vol. 47, no. 10, Oct. 1999. ##[113] B. S. Ko, R. Nishimura, and Y. Suzuki, Timespread echo method for digital audio watermarking, IEEE Trans. on Multimedia, vol. 7 , no. 2 , pp. 212221, Apr. 2005. ##[114] O. T. C. Chen, W. C. Wu, Highly Robust, Secure, and PerceptualQuality Echo Hiding Scheme, IEEE Trans. on Audio, Speech, and Language Process., vol. 16, no. 3, pp. 629638, Mar. 2008. ##[115] I. J. Cox, M. L. Miller, and A. L. McKellips, Watermarking as communications with side information, Proceeding of the IEEE, 87, pp. 11271141, July 1999. ##[116] A. B. Watson, J. Hu, and J. F. McGowan, III, DVQ: A digital video quality metric based on human vision, Journal Electronic Imaging, vol. 10, pp. 2029, Jan. 2001. ##[117] A. B. Watson, J. Y. Yang, J. A. Solomon, and J. Villasenor, Visibility of wavelet quantization noise, IEEE Trans. on Image Process., vol. 6, no. 8, pp. 11641175, Oct. 1997. ##[118] I. J. Cox, J. Kilian, F.T. Leighton, and T. Shamoon, Secure spread spectrum watermarking for multimedia, IEEE Trans. Image Process., vol. 6, no. 12, pp. 16731687, 1997. ##[119] Q. Cheng and T.S. Huang, An additive approach to transformdomain information hiding and optimum detection structure, IEEE Trans. Multimedia, vol. 3, no. 3, pp. 273284, 2001. ##[120] P. Moulin and A. Ivanovic The zerorate spread spectrum watermarking game, IEEE Trans. on Signal Process., vol. 51, no. 4, pp. 10981117, Apr. 2003. ##[121] H. O. Altun, A. Orsdemir, G. Sharma, and M. F. Bocko, Optimal spread spectrum watermark embedding via a multistep feasibility formulation, IEEE Trans. Image Process., vol. 18, no. 2, pp. 371386, Aug. 1999. ##[122] L. M. Marvel, C. G. Boncelet, and C. T. Retter, Spread spectrum image steganography, IEEE Trans. on Signal Process., vol. 8, no. 8, pp. 12851293, Aug. 1999. ##[123] S. P. Maity, and S. Maity, Multistage spread spectrum watermark detection, IEEE Signal Processing Lett., vol. 16, no. 4, Apr. 2009. ##[124] M. Barni, F. Bartolini, A. De Rosa, and A. Piva, A new decoder for the optimum recovery of nonadditive watermarks, IEEE Trans. Image Process., vol. 10, no. 5, pp. 755766, 2001. ##[125] Q. Cheng, and T. S. Huang, Robust optimum detection of transform domain multiplicative watermarks, IEEE Trans. Signal Processing, vol. 51, no. 4, pp. 906924, 2003. ##[126] M. Barni, F. Bartolini, A. De Rosa, and A. Piva, Optimum decoding and detection of multiplicative watermarks, IEEE Trans. on Signal Process., vol. 51, no. 4, pp.11181123, 2003. ##[127] T. M. Ng, H. Garg, Maximum likelihood detection in image watermarking using generalized gamma model, Proc. of 39th Asilomar Conference on Signals, Systemsand Computer, pp. 16801684, 2005. ##[128] V. Solachidis, and I. Pitas, Optimal detector for multiplicative watermarks embedded in the DFT domain of nonwhite signals, EURASIP Journal on Applied Signal Processing, vol. 16, pp. 522532, 2004. ##[129] J. Wang, G. Liu, Y. Dai, and J. Sun, Locally optimum detection for Barni multiplicative watermarking in DWT domain, Signal Processing, vol. 88, pp. 117130. 2008. ##[130] M. N. Do, and M. Vetterli, The contourlet transform: An efficient directional multiresolution image representation, IEEE Trans. on Image Process. vol. 14, no. 12, pp. 20912106, 2005. ##[131] M. N. Do, and M. Vetterli, Framing pyramids, IEEE Trans. on Signal Process., pp. 23292342, Sep. 2003. ##[132] M. A. Akhaee, N. KhademiKalantari, and F. Marvasti, Robust Multiplicative Audio and Speech Watermarking Using Statistical Modeling, Proc. of International Conference on Communications (ICC), 2009. ##[133] M. A. Akhaee, N. K. Kalantari, F. Marvasti, Robust audio and speech watermarking using Gaussian and Laplacian modeling, Signal Processing, vol. 90, no. 8, pp. 24872497, August 2010. ##[134] M. A. Akhaee, S. M. E. Sahraeian, F. Marvasti, and B. Sankur, Robust scalingbased image multiplicative watermarking technique using maximum likelihood decoder with optimum strength factor, IEEE Trans. on Multimedia, vol. 11, no 5, pp. 822833, Aug. 2009. ##[135] M. A. Akhaee, S. M. E. Sahraeian, F. Marvasti, Contourletbased image watermarking using optimum detector in a noisy environment, IEEE Trans. on Image Process., vol.19, no.4, pp. 967980, Apr 2010. ##[136] N. K. Kalantari, S. M. Ahadi, M. Vafadust, M., A robust image watermarking in the ridgelet domain using universally optimum decoder, IEEE Trans. on Circuits and Systems for Video Technology, vol. 20, no. 3, pp. 396 406, March 2010. ##[137] M. A. Akhaee, S. M. E. Sahraeian, F. Marvasti, Universal optimum blind scaling based Watermarking using maximum likelihood decoder, Proc. of International Conference on Image Processing (ICIP), pp. 765768, 2009. ##[138] S. M. E. Sahraeian, M. A. Akhaee, F. Marvasti, Information hiding with optimal detector for highly correlated signals, Proc. of International Conference on Communications (ICC), 2009. ##[139] J. J. Harmsen and W. A. Pearlman, Steganalysis of additivenoise modelable information hiding, in Society of PhotoOptical Instrumentation Engineers (SPIE) Conf., vol. 5020, pp. 131142, 2003. ##[140] A. D. Ker, Steganalysis of lsb matching in grayscale images, IEEE Signal Process. Lett., vol. 12, no. 6, pp. 441  444, Jun. 2005. ##[141] X. Li, T. Zeng, and B. Yang, Detecting lsb matching by applying calibration technique for difference image, Proc. of the 10th ACM workshop on Multimedia and security, pp. 133138, 2008. ##[142] T. Pevny, P. Bas, and J. Fridrich, Steganalysis by subtractive pixel adjacency matrix, IEEE Trans. on Information Forensics and Security, vol. 5, no. 2, pp. 215 224, Jun. 2010. ##[143] H. Farid, Detecting hidden messages using higherorder statistical models, International Conference on Image Processing, vol. 2, pp. 905908, 2002. ##[144] I. Avcibas, N. Memon, and B. Sankur, Steganalysis using image quality metrics, IEEE Transactions on Image Process., vol. 12, no. 2, pp. 221229, 2003. ##[145] F. Huang, B. Li, and J. Huang, Attack lsb matching steganography by counting alteration rate of the number of neighborhood gray levels, Proc. of International Conference on Image Processing, pp. 401404, 2007. ##[146] Y. Wang and P. Moulin, Optimized feature extraction for learningbased image steganalysis, IEEE Trans. on Info. Forensics and Security, vol. 2, no. 1, pp. 31 45, Mar. 2007. ##[147] T. Pevny, P. Bas, and J. Fridrich, Steganalysis by subtractive pixel adjacency matrix, IEEE Transactions on Info. Forensics and Security, vol. 5, no. 2, pp. 215224, 2010. ##[148] Y. Q. Shi, C. Chen, and W. Chen, A markov process based approach to effective attacking jpeg steganography, in Information Hiding. Springer, pp. 249264, 2007. ##[149] C. Chen and Y. Shi, Jpeg image steganalysis utilizing both intrablock and interblock correlations, Proc. of International Symposium on Circuits and Systems, pp. 30293032, 2008. ##[150] T. Pevny and J. Fridrich, Merging Markov and DCT features for multiclass JPEG steganalysis, Proceedings SPIE, Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents, vol. 3, pp. 11171126 2007. ##[151] J. Kodovsky, J. Fridrich, Steganalysis in high dimensions: fusing classifiers built on random subspaces, Proc. of SPIE Media Watermarking, Security, and Forensics III, pp. 2326, 2011. ##[152] Y. Shi, G. Xuan, D. Zou, J. Gao, C. Yang, Z. Zhang, P. Chai, W. Chen, and C. Chen, Image steganalysis based on moments of characteristic functions using wavelet decomposition, predictionerror image, and neural network, Proc. of International Conference on Multimedia and Expo(ICME), 2005. ##[153] C. C. Chang and C. J. Lin, Libsvm: a library for support vector machines, 2001, software available at http://www.csie.ntu.edu.tw/cjlin/libsvm. ##[154] J. Kodovsky, J. Fridrich, and V. Holub, Ensemble classifiers for steganalysis of digital media, IEEE Trans. on Info. Forensics and Security, vol. 7, no. 2, pp. 432444, 2012. ##]
Design and formal verification of DZMBE+
2
2
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature of our scheme is collusion resistance. Using secure multiparty computation, a traitor needs k cooperators in order to create a decryption machine. The broadcaster can choose the value of k as he decides to make a tradeoff between communication complexity and collusion resistance. Comparison with other Broadcast Encryption schemes indicates enhanced performance and complexity on the part of the proposed scheme (in terms of message encryption and decryption, key storage requirements, and ciphertext size) relative to similar schemes. In addition, the scheme is modeled using applied pi calculus and its security is verified by means of an automated verification tool, i.e., ProVerif.
1

37
53


M.
Soodkhah Mohammadi
Iran
xemailpro@yahoo.co.uk


A.
Ghaemi Bafghi
Iran
ghaemib@ferdowsi.um.ac.ir
Broadcast Encryption
Secure Multiparty Computation
Threshold Secret Sharing
Formal Methods
Applied pi Calculus
[[1] Shimshon Berkovits. How to broadcast a secret. In DonaldW. Davies, editor, Advances in Cryptology EUROCRYPT 91, volume 547 of Lecture Notes in Computer Science, pages 535541. Springer Berlin Heidelberg, 1991. ISBN 9783540546207. ##[2] Amos Fiat and Moni Naor. Broadcast encryption. In DouglasR. Stinson, editor, Advances in Cryptology CRYPTO 93, volume 773 of Lecture Notes in Computer Science, pages 480491. Springer Berlin Heidelberg, 1994. ISBN 9783540 577669. doi: 10.1007/354048329240. ##[3] Paolo DArco and DouglasR. Stinson. Fault tolerant and distributed broadcast encryption. In Marc Joye, editor, Topics in Cryptology CTRSA 2003, volume 2612 of Lecture Notes in Computer Science, pages 263280. Springer Berlin Heidelberg, 2003. ISBN 9783540008477. doi:10.1007/354036563X18. ##[4] Jung Hee Cheon, NamSu Jho, MyungHwan Kim, and Eun Sun Yoo. Skipping, cascade, and combined chain schemes for broadcast encryption. IEEE Transactions on Information Theory, 54(11):51555171, 2008. ##[5] Yanli Chen and Geng Yang. An efficient broadcast encryption scheme for wireless sensor network. pages 31383141. IEEE Press, 2009. ##[6] In Tae Kim and Seong Oun Hwang. An efficient identitybased broadcast signcryption scheme for wireless sensor networks. In Wireless and Pervasive Computing (ISWPC), 2011 6th International Symposium on, pages 16. 2011. doi:10.1109/ISWPC.2011.5751323. ##[7] Jeffrey B. Lotspiech. Broadcast encryption versus public key cryptography in content protection systems. In Proceedings of the ninth ACM workshop on Digital rights management, DRM'09, pages 3946. ACM, New York, NY, USA, 2009. ISBN 9781605587790. doi:10.1145/1655048.1655055. ##[8] Hongxia Jin and Jeffrey Lotspiech. Efficient traitor tracing for clone attack in content protection. In Proceedings of the 2011 ACM Symposium on Applied Computing, SAC '11, pages 15441549. ACM, New York, NY, USA, 2011. ISBN 9781450301138. doi: 10.1145/1982185.1982513. ##[9] Ccile Delerable, Pascal Paillier, and David Pointcheval. Fully Collusion Secure Dynamic Broadcast Encryption with ConstantSize Ciphertexts or Decryption Keys, volume 4575 of Lecture Notes in Computer Science, pages 3959. Springer Berlin Heidelberg, 2007. ISBN 9783540734888. ##[10] Dan Boneh and Brent Waters. A fully collusion resistant broadcast, trace, and revoke system. In Proceedings of the 13th ACM conference on Computer and communications security, CCS'06, pages 211220. ACM, New York, NY, USA, 2006. ISBN 1595935185. doi: 10.1145/1180405. ##[11] Ik Rae Jeong. Efficient secret broadcast in the broadcasting networks. Communications Letters, IEEE, 13(12):10011003, 2009. ##[12] Nelly Fazio and IrippugeMilinda Perera. Outsideranonymous broadcast encryption with sublinear ciphertexts. In Marc Fischlin, Johannes Buchmann, and Mark Manulis, editors, Public Key Cryptography PKC 2012, volume 7293 of Lecture Notes in Computer Science, pages 225242. Springer Berlin Heidelberg, 2012. ISBN 9783642300561. doi:10.1007/978364230057814. ##[13] Benot Libert, KennethG. Paterson, and Eliza bethA. Quaglia. Anonymous broadcast encryption: Adaptive security and efficient constructions in the standard model. In Marc Fischlin, Johannes Buchmann, and Mark Manulis, editors, Public Key Cryptography PKC 2012, volume 7293 of Lecture Notes in Computer Science, pages 206224. Springer Berlin Heidelberg, 2012. ISBN 9783642300561. doi: 10.1007/978364230057813. ##[14] Xinjun Du, Ying Wang, Jianhua Ge, and Yumin Wang. An idbased broadcast encryption scheme for key distribution. Broadcasting, IEEE Transactions on, 51(2):264266, 2005. ##[15] Wu Danfei and Zhang Weimin. Authenticated broadcast encryption with short ciphertexts and private keys. In Multimedia Technology (ICMT), 2011 International Conference on, pages 218221. 2011. doi:10.1109/ICMT.2011.6001984. ##[16] Dalit Naor, Moni Naor, and Jeff Lotspiech. Revocation and tracing schemes for stateless receivers. In Joe Kilian, editor, Advances in Cryptology CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 4162. Springer Berlin Heidelberg, 2001. ISBN 9783540424567. doi:10.1007/35404464783. ##[17] Xiaoming Wang and Zhiwei Liao. A secure encryption protocol for ad hoc networks. In Information Science and Engineering (ISISE), 2010 International Symposium on, pages 578581. 2010. doi: 10.1109/ISISE.2010.144. ##[18] Wenliang Du and Mikhail J. Atallah. Secure multiparty computation problems and their applications: a review and open problems. In Proceedings of the 2001 workshop on New security paradigms, NSPW '01, pages 1322. ACM, New York, NY, USA, 2001. ISBN 1581134576. doi:10.1145/508171.508174. ##[19] Andrew C. Yao, Andrew C. Yao, Andrew C. Yao, and Andrew C. Yao. Protocols for secure computations. In Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on, pages 160164. 1982. doi:10.1109/SFCS.1982.38. ##[20] N. Maheshwari and K. Kiyawat. Structural framing of protocol for secure multiparty cloud computation. In Modeling Symposium (AMS), 2011 Fifth Asia, pages 187192. ##[21] Ueli Maurer. Secure multiparty computation made simple. In Stelvio Cimato, Giuseppe Persiano, and Clemente Galdi, editors, Security in Communication Networks, volume 2576 of Lecture Notes in Computer Science, pages 1428. Springer Berlin Heidelberg, 2003. ISBN 9783540004202. doi:10.1007/35403641372. ##[22] Ronald Cramer, Ivan Damgrd, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In Jacques Stern, editor, Advances in Cryptology EUROCRYPT 99, volume 1592 of Lecture Notes in Computer Science, pages 311326. Springer Berlin Heidelberg, 1999. ISBN 9783540658894. doi: 10.1007/354048910X 22. ##[23] R. Canetti. Universally composable security: a new paradigm for cryptographic protocols. In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, pages 136145. 2001. doi:10.1109/SFCS.2001.959888. ##[24] B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Security and Privacy, 2001. S P 2001. Proceedings. 2001 IEEE Symposium on, pages 184200. 2001. doi:10. 1109/SECPRI.2001.924298. ##[25] Ran Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 13(1):143202, 2000. ##[26] Mikhail J. Atallah and Keith B. Frikken. Securely outsourcing linear algebra computations. In Proceedings of the 5th ACM Symposium on ##Information, Computer and Communications Security, ASIACCS '10, pages 4859. ACM, New York, NY, USA, 2010. ISBN 9781605589367. doi:10.1145/1755688.1755695. ##[27] Adi Shamir. How to share a secret. Commun. ACM, 22(11):612613, 1979. ##[28] Ronald Cramer, Ivan Damgrd, and JesperB. Nielsen. Multiparty computation from threshold homomorphic encryption. In Birgit Pfitzmann, editor, Advances in Cryptology EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 280300. Springer Berlin Heidelberg, 2001. ISBN 9783540420705. doi:10.1007/354044987618. ##[29] Moni Naor and Benny Pinkas. Efficient oblivious transfer protocols. In Proceedings of the twelfth annual ACMSIAM symposium on Discrete algorithms, SODA '01, pages 448457. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001. ISBN 0898714907. ##[30] Lin KengPei and Chen MingSyan. On the design and analysis of the privacypreserving svm classifier. Knowledge and Data Engineering, IEEE Transactions on, 23(11):17041717, 2011. ##[31] Dung Luong The, Bao Ho Tu, Binh Nguyen The, and Hoang TuanHao. Privacy preserving classification in twodimension distributed data. In Knowledge and Systems Engineering (KSE), 2010 Second International Conference on, pages 96103. ##[32] Z. Yu and N. Zhang. Achieving privacy preserving computation on data grids. In Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on, pages 763768. ##[33] Yang Piyi, Cao Zhenfu, Dong Xiaolei, and T. A. Zia. An efficient privacy preserving data aggregation scheme with constant communication overheads for wireless sensor networks. Communications Letters, IEEE, 15(11):12051207, 2011. ##[34] D. K. Mishra and M. Chandwani. A zerohacking protocol for secure multiparty computation using multiple ttp. In TENCON 2008  2008 IEEE Region 10 Conference, pages 16. ##[35] Gavin Lowe. Breaking and fixing the Needham Schroeder PublicKey Protocol using FDR, volume 1055 of Lecture Notes in Computer Science, chapter 10, pages 147166. Springer Berlin Heidelberg, 1996. ##[36] Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: the spi calculus. In Proceedings of the 4th ACM conference on Computer and communications security, CCS '97, pages 3647. ACM, New York, NY, USA, 1997. ISBN 0897919122. doi:10.1145/266420.266432. ##[37] Martín Abadi and Bruno Blanchet. Computer Assisted Verification of a Protocol for Certified Email, volume 2694 of Lecture Notes in Computer Science, chapter 17, pages 316335. Springer Berlin Heidelberg, 2003. ##[38] B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In Computer Security Foundations Workshop, 2001. Proceedings. 14th IEEE, pages 8296. 2001. doi:10.1109/CSFW.2001.930138. ##[39] Steve Kremer and Mark Ryan. Analysis of an electronic voting protocol in the applied pi calculus. In Mooly Sagiv, editor, Programming Languages and Systems, volume 3444 of Lecture Notes in Computer Science, pages 186200. Springer Berlin Heidelberg, 2005. ISBN 9783540254355. doi:10.1007/978354031987014. ##[40] Atsushi Fujioka, Tatsuaki Okamoto, and Kazuo Ohta. A practical secret voting scheme for large scale elections. In Jennifer Seberry and Yuliang Zheng, editors, Advances in Cryptology  AUSCRYPT '92, volume 718 of Lecture Notes in Computer Science, pages 244251. Springer Berlin Heidelberg, 1993. ISBN 9783540572206. doi:10.1007/354057220166. ##[41] Stphanie Delaune, Steve Kremer, and Mark Ryan. Verifying PrivacyType Properties of Electronic Voting Protocols: A Taster, volume 6000 of Lecture Notes in Computer Science, chapter 18, pages 289309. Springer Berlin Heidelberg, 2010. ##[42] R. Kusters and T. Truderung. An epistemicapproach to coercion resistance for electronic voting protocols. In Security and Privacy, 2009 30th IEEE Symposium on, pages 251266. 2009. doi:10.1109/SP.2009.13. ##[43] Steve Kremer, Mark Ryan, and Ben Smyth. Election verifiability in electronic voting protocols. In Dimitris Gritzalis, Bart Preneel, and Marianthi Theoharidou, editors, Computer Security ESORICS 2010, volume 6345 of Lecture Notes in Computer Science, pages 389404. Springer ##Berlin Heidelberg, 2010. ISBN 9783642154966. doi:10.1007/978364215497324. ##[44] Ben Adida. Helios: webbased openaudit voting. pages 335348. USENIX Association, 2008. ##[45] M.R. Clarkson, S. Chong, and A.C. Myers. Civitas: Toward a secure voting system. In Security and Privacy, 2008. SP 2008. IEEE Symposium on, pages 354368. 2008. doi:10.1109/SP.2008.32. ##[46] Ben Smyth, Mark Ryan, Steve Kremer, and Mounira Kourjieh. Towards automatic analysis of election verifiability properties. In Alessandro Armando and Gavin Lowe, editors, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, volume 6186 of Lecture Notes in Computer Science, pages 146163. Springer Berlin Heidelberg, 2011. ISBN 9783642160738. doi:10.1007/978364216074511. ##[47] Liqun Chen and Mark Ryan. Attack, solution and verification for shared authorisation data in tcg tpm. In Pierpaolo Degano and JoshuaD. ##Guttman, editors, Formal Aspects in Security and Trust, volume 5983 of Lecture Notes in Computer Science, pages 201216. Springer Berlin ##Heidelberg, 2010. ISBN 9783642124587. doi:10.1007/978364212459415. ##[48] M. Backes, M. Maffei, and D. Unruh. Zeroknowledge in the applied pi calculus and automated verification of the direct anonymous attestation protocol. In Security and Privacy, 2008. SP 2008. IEEE Symposium on, pages 202215. 2008. doi:10.1109/SP.2008.23. ##[49] Bruno Blanchet and Avik Chaudhuri. Automated formal analysis of a protocol for secure file sharing on untrusted storage. In Proceedings of the 29th IEEE Symposium on Security and Privacy (S&P'08), pages 417431. IEEE, 2008. ##[50] Martín Abadi, Bruno Blanchet, and Cedric Fournet. Just fast keying in the pi calculus. ACM Trans. Inf. Syst. Secur., 10(3):9, 2007. ##[51] Chetan Bansal, Karthikeyan Bhargavan, Antoine DelignatLavaud, and Sergio Maffeis. Keys to the cloud: formal analysis and concrete attacks on encrypted web storage. In Proceedings of the Second international conference on Principles of Security and Trust, POST'13, pages 126146. SpringerVerlag, Berlin, Heidelberg, 2013. ISBN 9783642368295. doi:10.1007/97836423683017. ##[52] Jannik Dreier, Pascal Lafourcade, and Yassine Lakhnech. Formal Verification of eAuction Protocols, volume 7796 of Lecture Notes in Computer Science, chapter 13, pages 247266. Springer Berlin Heidelberg, 2013. ##[53] Myrto Arapinis, Vronique Cortier, Steve Kremer, and Mark Ryan. Practical Everlasting Privacy, volume 7796 of Lecture Notes in Computer Science, chapter 2, pages 2140. Springer Berlin Heidelberg, 2013. ##[54] Denise Demirel, Jeroen Van De Graaf, and Roberto Arajo. Improving helios with everlasting privacy towards the public. In Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections, EVT/WOTE'12, pages 88. USENIX Association, Berkeley, CA, USA, 2012. ##[55] Tal Moran and Moni Naor. ReceiptFree UniversallyVerifiable Voting with Everlasting Privacy, volume 4117 of Lecture Notes in Computer Science, chapter 22, pages 373392. Springer Berlin Heidelberg, 2006. ##[56] Martín Abadi and Cedric Fournet. Mobile values, new names, and secure communication. SIGPLAN Not., 36(3):104115, 2001. ##[57] Robin Milner. Communicating and mobile systems: the picalculus. ##Cambridge University Press, 1999. ##[58] Danny Dolev and Andrew C. Yao. On the security of public key protocols. Technical report, Stanford University, 1981. ##[59] M. S. Mohammadi and A. G. Bafghi. A dynamic, zeromessage broadcast encryption scheme based on secure multiparty computation. In Information Security and Cryptology (ISCISC), 2012 9th International ISC Conference on, pages 1217. ##[60] V. I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165172, 1994. ##[61] HungYu Lin and Lein Harn. Fair reconstruction of a secret. Inf. Process. Lett., 55(1):4547, 1995. ##[62] Dan Boneh, Craig Gentry, and Brent Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In Victor Shoup, editor, Advances in Cryptology CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pages 258275. Springer Berlin Heidelberg, 2005. ISBN 9783540281146. ##[63] Adrian Perrig. Efficient collaborative key management protocols for secure autonomous group communication. In International Workshop on Cryptographic Techniques and ECommerce CrypTEC '99, pages 192202.##]
Provably secure and efficient identitybased key agreement protocol for independent PKGs using ECC
2
2
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identitybased key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identitybased cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is generated by a trusted Private Key Generator (PKG). However, it is unrealistic to assume that a single PKG will be responsible for issuing private keys to members of different organizations or a largescale nation. Hence, it is needed to consider multiple PKG environments with different system parameters. In this paper, we propose an identitybased key agreement protocol among users of different networks with independent PKGs, which makes use of elliptic curves. We prove the security of the proposed protocol in the random oracle model and show that all security attributes are satisfied. We also demonstrate a comparison between our protocol and some related protocols in terms of the communication costs and the execution time. The results show that the execution time of our protocol is less than 10%, and its communication costs are about 50% of the competitor protocols.
1

55
70


M.
Sabzinejad Farash
sabzinejad@tmu.ac.ir
sabzinejad@tmu.ac.ir
Iran
sabzinejad@tmu.ac.ir


M.
Ahmadian Attari
Iran
mahmoud@eetd.kntu.ac.ir
IdentityBased Cryptography
Key Agreement Protocol
Elliptic Curve Cryptography
Random Oracle Model
[[1] ISO/IEC 95948 :( the 4th edn.), "Information technologyOpen Systems InterconnectionThe Directory: Publickey and attribute certificate frameworks," International Organization for Standardization, Geneva, Switzerland, 2001. ##[2] A. Shamir, "Identitybased cryptosystems and signature schemes," Proc. of CRYPTO 1984, LNCS, vol. 196, 1984, pp. 4753. ##[3] R.L. Rivest, A. Shamir, L. Adleman, "A Method for Obtaining Digital Signatures and PublicKey Cryptosystems," Communications of the ACM, vol. 21, no. 2, 1978, pp. 120126. ##[4] D. Boneh, M. Franklin, "Identitybased encryption from the weil pairing," Proc. Of CRYPTO2001, LNCS, vol. 2139, 2001, pp. 213229. ##[5] N. Smart, "An Identitybased Authenticated Key Agreement Protocol Based on Weil Pairing," Electronic Letters, vol. 38, 2002, pp. 630632. ##[6] N.Y. Lee, C.N.Wu, C.C.Wang, "Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings," Computers & Electrical Engineering, vol. 34, no. 1, 2008, pp. 1220. ##[7] D.L. Vo, H. Lee, C.Y. Yeun, K. Kim, "Enhancements of authenticated multiple key exchange protocol based on bilinear pairings," Computers & Electrical Engineering, vol. 36, no. 1, 2009, pp. 155159. ##[8] M.S. Farash, M. Bayat, M.A. Attari, "Vulnerability of two multiplekey agreement protocols," Computers & Electrical Engineering, vol. 37, no. 2, 2011, pp. 199204. ##[9] M.S. Farash, M. Gardeshi, M. Bayat, "Security Enhancement of a multiplekey exchange protocol based on bilinear pairings," 6th International ISC Conference on Information Security and Cryptology (ISCISC2009), 2009, pp. 175182. ##[10] Q. Cheng, C. Ma, "Analysis and improvement of an authenticated multiple key exchange protocol," Computers & Electrical Engineering, vol. 37, no. 2, 2011, pp. 187190. ##[11] L. Ni, G. Chen, J. Li, Y. Hao, "Strongly secure identitybased authenticated key agreement protocols," Computers & Electrical Engineering, vol. 37, no. 2, 2011, pp. 205217. ##[12] M. Holbl, T. Welzer, B. Brumen, "An improved twoparty identitybased authenticated key agreement protocol using pairings," Journal ##of Computer and System Sciences, vol. 78, no. 1, 2012, pp. 142150. ##[13] D. He, "An efficient remote user authentication and key agreement protocol for mobile clientserver environment from pairings," Ad Hoc Networks, vol. 10, no. 6, 2012, pp. 10091016. ##[14] Z. Zhang, L. Zhu, L. Liao, and M.Wang, "Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings," Information Sciences, vol. 209, 2012, pp. 93112. ##[15] Y. Chuang, Y. Tseng, "Towards generalized IDbased user authentication for mobile multiserver environment," International Journal of Communication Systems, vol. 25, no. 4, 2012, pp. 447460. ##[16] K. Shim, "A roundoptimal threeparty IDbased authenticated key agreement protocol, "Information Sciences, vol. 186, 2012, pp. 239248. ##[17] K. Shim, "Cryptanalysis of Two IdentityBased Authenticated Key Agreement Protocols," IEEE Communications Letters, vol. 16, no. 4, 2012, pp. 554556. ##[18] L. Ni, G. Chen, and J. Li, "Escrowable identitybased authenticated key agreement protocol with strong security," Computers and Mathematics with Applications, 2012, ##doi:10.1016/j.camwa.2012.01.041. ##[19] M.S. Farash, M.A. Attari, "A new improved and efficient authenticated multiplekey agreement protocol based on bilinear pairings," Computers & Electrical Engineering, 2012, http://dx.doi. ##org/10.1016/j.compeleceng.2012.09.004. ##[20] L. Chen, Z. Cheng, N.P. Smart, "Identitybased key agreement protocols from pairings," International Journal of Information Security, vol. 6, no. 4, 2007, pp. 213241. ##[21] P. Barreto, H. Kim, B. Lynn, M. Scott, "Efficient algorithms for pairingbased cryptosystems," Proc. CRYPTO 2002, LNCS, vol. 2442, 2002, pp. 354368, Springer. ##[22] P. Barreto, B. Lynn, M. Scott, "On the selection of pairingfriendly groups," Selected Areas in Cryptography (SAC 2003), LNCS, vol. 3006, 2003, pp. 1725. ##[23] D. He, J. Chen, J. Hu, "An IDbased client authentication with key agreement protocol for mobile clientserver environment on ECC with provable security. Information Fusion, vol. 13, no. 3, 2012, pp. 223230. ##[24] W. Han and Z. Zhu, "An IDbased mutual authentication with key agreement protocol for multiserver environment on elliptic curve cryptosystem," International Journal of Communication Systems, 2012, DOI: 10.1002/dac.2405. ##[25] S. H. Islam, G. P. Biswas, "A more efficient and secure IDbased remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem," The Journal of Systems and Software, vol. 84, no. 11, 2011, pp. 18921898. ##[26] R.W. Zhu, G. Yang, D.S. Wong, "An efficient identitybased key exchange protocol with KGS forward secrecy for lowpower devices, Theor. Comput. Sci. vol. 9, no. 378, 2007, pp. 198207. ##[27] X. Cao, W. Kou, Y. Yu, R. Sun, "Identitybased authentication key agreement protocols without bilinear pairings," IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E91A, no. 12, 2008, pp. 38333836. ##[28] X. Cao, W. Kou, Y. Yu, R. Sun, "Identitybased authentication key agreement protocols without bilinear pairings," Information Sciences, vol. 180, 2010, pp. 28952903. ##[29] S.K. Hafizul Islam, G.P. Biswas, "An improved pairingfree identitybased authenticated key agreement protocol based on ECC," International Conference on Communication Technology and System Design 2011, Procedia Engineering, vol. 30, 2012, pp. 499507. ##[30] H. Lee, D. Kim, S. Kim, H. Oh, "Identitybased Key Agreement Protocols in a Multiple PKG Environment," Proc. of the Int. Conf. on Computational Science and Its Applications, ICCSA 2005. LNCS, vol. 3483, 2005, pp. 877886. ##[31] S. Kim, H. Lee, H. Oh, "Enhanced IDBased Authenticated Key Agreement Protocols for a Multiple Independent PKG Environment," Proc. Of ICICS 2005, LNCS, vol. 3783, 2005, pp. 323335. ##[32] M.S. Farash, M.A. Attari, "An IDBased Key Agreement Protocol Based on ECC Among Users of Separate Networks," 9th International ISC Conference on Information Security and Cryptology (ISCISC2012), September 2012, Tabriz, Iran. ##[33] I.F. Blake, G. Seroussi and N.P. Smart, "Advances Elliptic Curves in Cryptography," London Mathematical Society Lecture Note Series. 317, United States of America by Cambridge University Press, New York, 2005. ##[34] A. Joux and K. Nguyen, "Separating Decision DiffieHellman from DiffieHellman in cryptographic groups," Journal of Cryptology, no. 16, 2003, pp. 239248. ##[35] S. BlakeWilson, A. Menezes, Authenticated DiffieHellman key agreement protocols, in: Proc. SAC98, LNCS vol. 1556, 1999, pp. 339 361. ##[36] C. Boyd, A. Mathuria, Protocols for Authentication and Key Establishment. SpringerVerlag, June 2003. ##[37] C. Kudla, "Special signature schemes and key agreement protocols," Ph.D. Thesis, Royal Holloway University of London, 2006. ##[38] M. Bellare and Ph. Rogaway, "Entity Authentication and Key Distribution," In Advances in CryptologyCRYPTO93, LNCS, vol. 773, 1993, pp. 232249. ##[39] M. Bellare and Ph. Rogaway, "Provably secure session key distribution: the three party case," In Proc. of the 27th Annual ACM Symposium on Theory of ComputingSTOC'95, 1995, pp. 5766. ##[40] S. BlakeWilson, D. Johnson, A. Menezes, "Key agreement protocols and their security analysis," Proc. of the 6th IMA International Conference on Cryptography and Coding, 1997, pp. 3045. ##[41] L. Chen, C. Kudla, "Identity based authenticated key agreement from pairings," In IEEE Computer Security Foundations Workshop, 2003, pp. 219233. ##[42] K. Choo, C. Boyd, Y. Hitchcock, "On session key construction in provablysecure key establishment protocols: revisiting Chen & Kudla (2003) and McCullagh & Barreto (2005) IDbased protocols," In Mycrypt'05, LNCS, vol. 3715, 2005, pp. 116131. ##[43] Z. Cheng, M. Nistazakis, R. Comley, L. Vasiu, "On the indistinguishabilitybased security model of key agreement protocolssimple cases," Cryptology ePrint Archive, Report 2005/129. ##[44] C. Kudla, K. Paterson,"Modular security proofs for key agreement protocols," In Advances in CryptologyAsiacrypt'05, LNCS, vol. 378, 2005, pp. 549565. ##[45] Y. Wang, "Efficient identitybased and authenticated key agreement protocol," Cryptology ePrint Archive, Report 2005/108. ##[46] Shamus Software Ltd., Miracl library. http://www.shamus.ie/index.php?page=home. ##]
DyVSoR: dynamic malware detection based on extracting patterns from value sets of registers
2
2
To control the exponential growth of malware files, security analysts pursue dynamic approaches that automatically identify and analyze malicious software samples. Obfuscation and polymorphism employed by malwares make it difficult for signaturebased systems to detect sophisticated malware files. The dynamic analysis or runtime behavior provides a better technique to identify the threat. In this paper, a dynamic approach is proposed in order to extract features from binaries. The runtime behavior of the binary files were found and recorded using a homemade tool that provides a controlled environment. The approach based on DyVSoR assumes that the runtime behavior of each binary can be represented by the values of registers. A method to compute the similarity between two binaries based on the value sets of the registers is presented. Hence, the values are traced before and after invoked API calls in each binary and mapped to some vectors. To detect an unknown file, it is enough to compare it with dataset binaries by computing the distance between registers, content of this file and all binaries. This method could detect malicious samples with 96.1% accuracy and 4% false positive rate. The list of execution traces and the dataset are reachable at: http://home.shirazu.ac.ir/˷ sami/malware
1

71
82


M.
Ghiasi
Iran
mhbbgh@gmail.com


A.
Sami
Iran
asami@ieee.org


Z.
Salehi
Iran
zsalehi@cse.shirazu.ac.ir
Malware Detection
API Call
Dynamic Analysis
CPU Register Values
x86 Registers Values
[[1] M. Christodorescu, S. Jha, S. A. Seshia, D. Song, and R. E. Bryant, "SemanticsAware Malware Detection," IEEE Symposium on Security and Privacy (S&P05), Washington. DC. USA, pp. 3246, 2005. ##[2] Symantec Corp, "Symantec Global Internet Security Threat Report," Vol. 7, 2008. ##[3] PandaLabs, "Pandalabs annual malware report 2009," 2010. ##[4] K. Kim, and B. R. Moon, "Malware detection based on dependency graph using hybrid genetic algorithm," Proceedings of the 12th Annual Conf. on Genetic and Evolutionary Computation, ACM. USA. , pp. 12111218, July 2010. ##[5] McAfee Labs, "McAfee Threats Report: Fourth Quarter 2010," McAfee Inc., Santa Clara. California, 2010. ##[6] X. Hu, "LargeScale Malware Analysis, Detection, and Signature Generation," A dissertation for the degree of Doctor of Philosophy, University of Michigan, Ann Arbor. Michigan. United States, 2011. ##[7] P. Wood, M. Nisbet, G. Egan, N. Johnston, K. Haley, B. Krishnappa, T. K. Tran, I. Asrar, O. Cox, S. Hittel, et al., "Symantec Internet Security Threat Report Trends for 2011," Vol. 17, Symantec Corporation, 2012. ##[8] PandaLabs, "Pandalabs annual malware report 2011," 2012. ##[9] Panda Security, "PandaLabs Annual Report 2012," 2013. ##[10] Sophos, "Security threat report 2013 New Platforms and Changing Threats," Sophos Ltd., Boston, USA, 2013. ##[11] Macafee Labs, "McAfee Threats Report: Fourth Quarter 2012," McAfee Inc, 2013. ##[12] Symantec Corporation, "Internet Security Threat Report 2013," Vol. 18, 2013. ##[13] Sophos, "Security threat report 2011," Sophos Ltd., Boston, USA, January 2011. ##[14] Symantec Corporation, "The Shamoon Attacks," [Online]. Available electronically at http://www.symantec.com/connect/blogs/shamoonattacks. 2012. ##[15] Norton by Symantec, "2012 Norton Cybercrime Report," 2012. ##[16] A. E. Ammar, A. M. Mohd, and H. Ahmed, "Malware Detection Based on Hybrid Signature Behaviors Application Programming Interface Call Graph," American J of Applied Sciences, United States, vol. 3, pp. 283288, 2012. ##[17] L. Bohne, "Pandoras Bochs: Automatic Unpacking of Malware," Diploma Thesis, University of Mannheim, January 2008. ##[18] M. Egele, T. Scholte, E. Kirda, and C. Kruegel, "A survey on automated dynamic malware analysis techniques and tools," ACM Computing Surveys (CSUR) J., Vol. 44, ACM. New York. USA, pp. 149, February 2012. ##[19] S. M. Abdulalla, L. M. Kiah, and O. Zakariam, "A biological Model to Improve PE Malware Detection: Review," Int. J. of Physical Sciences, vol. 5, pp. 22362247, 2010. ##[20] K. M. Goertzel, "Tools on Anti Malware," Technical Information Center, 2009. ##[21] Li. Shengying, "A survey on tools for binary code analysis," Stony Brook University, August 2004. ##[22] M. Bailey, J. Oberheide, J. Andersen, Z. Mao, F. Jahanian, and J. Nazario, "Automated Classification and Analysis of Internet Malware," In Proceedings of Symposium on Recent Advances in Intrusion Detection (RAID07), pp. 178197, 2007. ##[23] M. Yahyazadeh, and M. Abadi, "BotOnus: An Online Unsupervised Method for Botnet Detection," The ISC Int. J. of Information Security (ISeCure), vol. 4, pp. 5162, January 2012. ##[24] P. Li, L. Liu, D. Gao, and M. K. Reiter, "On challenges in evaluating malware clustering," In Proceedings of the 13th Int. Conf. on Recent advances in intrusion detection (RAID10), Berlin. Heidelberg, pp. 238255, 2010. ##[25] Z. Salehi, M. Ghiasi, and A. Sami, "Malware Detection Preserving API Function Calls and Their Standard Function Calling Notation," In ##Proceeding of 16th CSI Symposium on Artificial Intelligence and Signal Processing (AISP 2012), Shiraz, Iran, 2012. ##[26] H. Zhao, M. Xu, N. Zheng, J. Yao, and Q. Ho, "Malicious executable classification based on behavioral factor analysis," In Proceeding Int. Conf. on eEducation, eBusiness, eManagement and eLearning (IC4E 2010), Sanya. China, pp. 502 506, 2010. ##[27] F. Ahmed, H. Hameed, M. Z. Shafiq, and M. Farooq, "Using spatiotemporal information in api calls with machine learning algorithms for malware detection," In Proceeding Second ACM workshop on Security and artificial intelligence (AISec 09), New York, USA, pp. 5562, 2009. ##[28] R. Tian, R. Islam, and L. Batten, "Differentiating Malware from Cleanware Using Behavioral Analysis," In Proceeding Fifth Int. Conf. on Malicious and Unwanted Software (MALWARE 2010), Nancy, France, pp. 2330, 2010. ##[29] F. Leder, B. Steinbock, and P. Martini, "Classification and detection of metamorphic malware using value set analysis," In Proceeding Fourth Int. Conf. on Malicious and Unwanted Software (MALWARE 2009), pp. 3946, 2009. ##[30] V. S. Sathyanarayan, P. Kohli, and B. Bruhadeshwar, "Signature Generation and Detection of Malware Families," In Information Security and Privacy 13th Australasian Conf. (ACISP 2008),Wollongong, Australia, pp. 336349, July 2008. ##[31] R. Moskovitch, D. Stopel, C. Feher, N. Nissim, and Y. Elovici, "Unknown Malcode Detection via Text Categorization and the Imbalance Problem," Intelligence and Security Informatics (ISI 2008), Taipei. Taiwan, pp. 156181, 2008. ##[32] I. Santos, F. Brezo, J. Nieves, Y. K. Penya, B. Sanz, C. Laorden, and P. G. Bringas, "Idea: Opcodesequencebased malware detection," In Engineering Secure Software and Systems Second Int. Symposium (ESSoS 2010), Pisa. Italy, pp. 3543, February 2010. ##[33] R. Tian, L. M. Batten, and S. C. Versteeg, "Function Length as a Tool for Malware Classification," In Proceedings of the 3rd Int. Conf. on Malicious and Unwanted Software (Malware 2008), pp. 6976, 2008. ##[34] R. Tian, L. Batten, R. Islam, and S. Versteeg, "an Automated Classification System based on the Strings of Trojan and Virus Families," In Proceedings of the 4th Int. Conf. on Malicious and Unwanted Software (MALWARE 2009), Quebec. Canada, pp. 2330, October 2009. ##[35] Y. Ye, T. Li, Q. Jiang, and Y. Wang, "CIMDS: Adapting Post processing Techniques of Associative Classification for Malware Detection," IEEE Trans. Systems, Man, and Cybernetics, Part C: Applications and Reviews, Vol. 40, pp. 298307, May 2010. ##[36] A. Sami, B. Yadegari, H. Rahimi, N. Peiravian, S. Hashemi, and A. Hamze, "Malware detection based on mining API calls," In Proceedings of ACM Symposium on Applied Computing (SAC 10), Switzerland, pp. 10201025, March 2010. ##[37] G. Tahan, L. Rokach, and Y. Shahar, "MalID: Automatic Malware Detection Using Common Segment Analysis and MetaFeatures," The J. of Machine Learning Research, Vol. 13, pp. 949979, 2012. ##[38] M. K. Shankarapani, S. Ramamoorthy, R. S. Movva, and S. Mukkamala, "Malware detection using assembly and API call sequences," J. in Computer Virology, Vol. 7, pp. 107119, 2010. ##[39] P. M. Comparetti, G. Salvaneschi, E. Kirda, C. Kolbitsch, C. Kruegel, and S. Zanero, "Identifying Dormant Functionality in Malware Programs," IEEE Symposium on Security and Privacy (S&P 2010), Berleley/Oakland. California. USA, pp. 6176, May 2010. ##[40] M. Christodorescu, S. Jha, and C. Kruegel, "Mining specifications of malicious behavior," Foundations of Software Engineering, pp. 110, 2007. ##[41] L. Bai, J. Pang, Y. Zhang, W. Fu, and J. Zhu, "Detecting malicious behavior using critical API calling graph matching," Proceedings of the 1st Int. Conf. on Information Science and Engineering, Nanjing, pp. 17161719, 2009. ##[42] H. Guo, J. Pang, Y. Zhang, F. Yue, and R. Zhao, "HERO: A novel malware detection framework based on binary translation," Proceedings of the IEEE Int. Conf. on Intelligent Computing and Intelligent Systems, Xiamen, pp. 411415, 2010. ##[43] Y. Park, D. Reeves, V. Mulukutla, and B. Sundaravel, "Fast malware classification by automated behavioral graph matching," Proceedings of the 6th Annual Workshop on Cyber Security and Information Intelligence Research, USA, 2010. ##[44] F. Karbalaee, A. Sami, and M. Ahmadi, "Semantic Malware Detection by Deploying Graph Mining," Int. J. of Computer Science Issues (IJCSI 2012), Vol. 9, pp. 373379, 2012. ##[45] O. Kostakis, J. Kinable, H. Mahmoudi, and K. Mustonen, "Improved call graph comparison using simulated annealing," Proceedings of the 2011 ACM Symposium on Applied Computing, USA, pp. 15161523, 2011. ##[46] Y. Park, and D. Reeves, "Deriving common malware behavior through graph clustering", Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, USA, pp. 497502, 2011. ##[47] M. Ahmadi, A. Sami, H. Rahimi, and B. Yadegari, "Iterative System Call Patterns Blow the Malware Cover," IT Security for The Next Generation, Asia Pacific & MEA Cup 2011, Malaysia, March 2011. ##[48] G. Wagener, R. State, and A. Dulaunoy, "Malware behavior analysis," J. in Computer Virology, Vol. 4, pp. 279287, 2008. ##[49] U. Bayer, P. M. Comparetti, C. Hlauschek, C. Kruegel, and E. Kirda, "Scalable, Behavior Based Malware Clustering," Proceedings of the 16th Annual Network and Distributed System Security Symposium (NDSS'09), San Diego, February 2009. ##[50] U. Bayer, E. Kirda, and C. Kruegel, "Improving the Efficiency of Dynamic Malware Analysis," In Proceedings of the 2010 ACM Symposium on Applied Computing (SAC '10), NY, USA, pp. 18711878, 2010. ##[51] J. Jang, D. Brumley, and S. Venkataraman, "Bit Shred: Feature Hashing Malware for Scalable Triage and Semantic Analysis," Proceedings of the 18th ACM conf. on Computer and Communications Security, ACM, pp. 309320, 2011. ##[52] J. Hegedus, Y. Miche, A. Ilin, and A. Lendasse, "Methodology for Behavioralbased Malware Analysis and Detection Using Random Projections and KNearest Neighbors Classifiers," In Proceedings of the Seventh Int. Conf. on Computational Intelligence and Security, Sanya, Hainan, China, pp. 10161023, 2011. ##[53] J. Potier, "WinAPIOverride32," 2013. [Online]. Available electronically at http://jacquelin.potier.free.fr/winapioverride32/. ##[54] M. Fredrikson, S. Jha, M. Christodorescu, "Synthesizing NearOptimal Malware Specification from Suspicious Behaviors," Proceeding 31st IEEE Symposium on Security and Privacy (S&P 2010), pp. 4560, 2010. ##[55] R. Kohavi, "A study of crossvalidation and bootstrap for accuracy estimation and model selection," In Proceedings of the Fourteenth Int. Joint Conf. on Artificial Intelligence, pp. 11371143, 1995. ##[56] L. Breiman, "Random Forests," Kluwer Academic Publishers. Manufactured in The Netherlands. 2001. ##[57] T. Langerud, "PowerScan: A Framework for Dynamic Analysis and AntiVirus Based Identification of Malware," Master thesis, Norwegian University of Science and Technology Department of Telematics, Norway, 2008. ##[58] C. G. Weng, and J. Poon. "A New Evaluation Measure for Imbalanced Datasets," In Seventh Australasian Data Mining Conf. (AusDM 2008), pp. 2732, 2008. ##[59] A. Fog, "Function calling conventions," In Calling conventions for different C++ compilers and operating systems, Copenhagen, Denmark, 2012. ##[60] J. Potier, "Where is located the return value?," [Online]. Available electronically at http://jacquelin.potier.free.fr/winapioverride32/doc/faq.ht m#returnvalue, 2011. ##[61] Intel Corporation, "Intel Itanium Processor specific Application Binary Interface (ABI) Intel," 2001. ##]
Robust multiplicative video watermarking using statistical modeling
2
2
The present paper is intended to present a robust multiplicative video watermarking scheme. In this regard, the video signal is segmented into 3D blocks like cubes, and then, the 3D wavelet transform is applied to each block. The low frequency components of the wavelet coefficients are then used for data embedding to make the process robust against both malicious and unintentional attacks. The hidden message is inserted through multiplying/dividing these coefficients by a constant parameter which controls the power of the watermark. The watermark extraction relies on a maximum likelihoodbased procedure, observing the distribution of the watermarked coefficients. The performance of the proposed scheme has been verified via simulations and found to be superior to some of the wellknown existing video watermarking methods.
1

83
95


A.
Diyanat
Iran
a.diyanat@ut.ac.ir


M. A.
Akhaee
Iran
akhaee@ut.ac.ir


Sh.
Ghaemmaghami
Iran
ghaemmagh@sharif.edu
Multiplicative Video Watermarking
Maximum Likelihood Decoding
3D Wavelet Transform
[[1] G. Döerr, “A Guide Tour of Video Watermarking,” Signal Processing: Image Communication, vol. 18, pp. 263282, Apr. 2003. ##[2] Y. Chen and H. Huang, “A New ShotBased Video Watermarking,” in Computer Communication Control and Automation (3CA), International Symposium on, vol. 2, pp. 5358, 2010. ##[3] M. Belhaj, M. Mitrea, F. Preteux, and S. Duta, “MPEG4 AVC robust video watermarking based on QIM and perceptual masking,” in Communications (COMM), 8th International Conference on, pp. 477480,2010. ##[4] D. Xu, R. Wang, and J. Wang, “Low complexity video watermarking algorithm by exploiting CAVLC in H. 264/AVC,” in Wireless Communications, Networking and Information Security (WCNIS), IEEE International Conference on, pp. 411415, 2010. ##[5] L. Zhang, Y. Zhu, and L. L.M. Po, “A novel watermarking scheme with compensation in bit stream domain for H.264/AVC,” IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 17581761, Mar. 2010. ##[6] G. Langelaar, R. Lagendijk, and J. Biemond, “RealTime Labeling of MPEG2 Compressed Video,” Journal of Visual Communication and Image Representation, vol. 9, no. 4, pp. 256270, 1998. ##[7] S. K. Bavipati and X. Su, “Secure Compressed Domain Watermarking for H.264 Video,” Seventh International Conference on Information Technology: New Generations, pp. 387391, Apr. 2010. ##[8] S. N. Biswas, S. Nahar, S. R. Das, E. M. Petriu, M. H. Assaf, and V. Groza, “MPEG2 digital video watermarking technique,” in IEEE International Instrumentation and Measurement Technology Conference Proceedings, pp. 225229, IEEE, May 2012. ##[9] R. Lancini, F. Mapelli, and S. Tubaro, “A Robust Video Watermarking Technique In the Spatial Domain,” in Video/Image Processing and Multimedia Communications 4th EURASIPIEEE Region 8 International Symposium on VIPromCom, no. June, pp. 251256, 2002 ##[10] P. Chan and M. Lyu, “A DWTbased digital video watermarking scheme with error correcting code,” in Proceedings of Fifth International Conference on Information and Communications Security, pp. 202213, Springer, 2003. ##[11] F. Deguillaume, G. Csurka, J. O’Ruanaidh, and T. Pun, “Robust 3D DFT Video Watermarking,” in Proceedings of IS & T/SPIE Electronic Imaging, vol. 3657, pp. 113124, 1999. ##[12] J. Zhang, J. Li, and L. Zhang, “Video watermark technique in motion vector,” in Computer Graphics and Image Processing, Proceedings of XIV Brazilian Symposium on, pp. 179182, 2001. ##[13] C. Kung, J. Jeng, Y. Lee, H. Hsiao, and W. Cheng, “Video watermarking using motion vector,” in Proc. of 16th IPPR Conference on computer vision, graphics and image processing, no. Cvgip, pp. 547551, 2003. ##[14] B. Barakli and C. Vural, “A new reversible video watermarking methodbased on motion compensated interpolation,” in 20th Signal Processing and Communications Applications Conference (SIU), pp. 14, IEEE, Apr. 2012. ##[15] B. Mobasseri, “Direct Sequence Watermarking of Digital Video Using MFrames,” in Proceedings International Conference on Image Processing (ICIP98), vol. 2, pp. 399403, 1998. ##[16] A. M. Kothari and V. V. Dwivedi, “Transform Domain Video Watermarking: Design, Implementation and Performance Analysis,” in International Conference on Communication Systems and Network Technologies, pp. 133137, IEEE, May 2012. ##[17] S. a. M. AlTaweel and P. Sumari, “Robust Video Watermarking Based On 3DDWT Domain,” in TENCON , IEEE Region 10 Conference, pp. 16, Nov. 2010. ##[18] P. Campisi, “Video watermarking in the 3DDWT domain using perceptual masking,” in IEEE International Conference on Image Processing(ICIP), pp. 9971000, 2005. ##[19] R. Reyes, C. Cruz, M. NakanoMiyatake, and H. PerezMeana, “Digital Video Watermarking in DWT Domain Using Chaotic Mixtures,” Latin America Transactions, IEEE (Revista IEEE America Latina), vol. 8, no. 3, pp. 304310, 2010. ##[20] R. O. Preda, “Robust waveletbased video watermarking scheme for copyright protection using the human visual system,” Journal of Electronic Imaging, vol. 20, p. 013022, Jan. 2011. ##[21] M. Swanson and A. Tewfik, “Multi resolution SceneBased Video Watermarking Using Perceptual Models,” IEEE Journal on Selected Areasin Communications, vol. 16, pp. 540550, May 2002. ##[22] J. Sun, N. Yang, J. Liu, X. Yang, X. Li, and L. Zhang, “Video watermarking scheme based on spatial relationship of DCT coefficients,” in Intelligent Control and Automation (WCICA), 8th World Congress on, pp. 5659, 2010. ##[23] E. E. Abdallah, A. Ben Hamza, and P. Bhattacharya, “Video watermarking using wavelet transform and tensor algebra,” Signal, Image and Video Processing, vol. 4, pp. 233245, Apr. 2009. ##[24] X. Guojuan and W. Rangding, “A Blind Video Watermarking Algorithm Resisting to Rotation Attack,” International Conference on Computer and Communications Security, pp. 111114, Dec. 2009. ##[25] C.X. Wang, X. Nie, X. Wan, W. B. Wan, and F. Chao, “A Blind Video Watermarking Scheme Based on DWT,” Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, vol. 1, pp. 434437, Sept. 2009. ##[26] R. C. Motwani, M. C. Motwani, B. D. Bryant, F. C. Harris Jr., and A. S. Agarwal, “Watermark Embedded Optimization for 3D Mesh Objects Using Classification Based Approach,” International Conference on Signal Acquisition and Processing, pp. 125129, Feb. 2010. ##[27] D. Pu, Y. Lu, and J. Dai, “Video watermarking approach based on temporal difference and discrete wavelet transform,” in Computer Science and Information Technology (ICCSIT), 3rd IEEE International Conference on, vol. 1, pp. 346350, 2010. ##[28] M. A. Akhaee, S. M. E. Sahraeian, B. Sankur, and F. Marvasti, “Robust ScalingBased Image Watermarking Using Maximum Likelihood Decoder With Optimum Strength Factor,” IEEE Transactions on Multimedia, vol. 11, pp. 822833, Aug. 2009. ##[29] I. I. Cox, J. Kilian, F. F. Leighton, and T. Shamoon, “Secure Spread Spectrum Watermarking For Multimedia,” Image Processing, IEEE Transactions on, vol. 6, no. 12, pp. 16731687, 2002. ##[30] M. Barni, F. Bartolini, A. D. Rosa, and A. Piva, “A new decoder for the optimum recovery of nonadditive watermarks,” IEEE transactions on image processing, vol. 10, pp. 75566, Jan. 2001. ##[31] J. Wang, G. Liu, Y. Dai, J. Sun, Z. Wang, and S. Lian, “Locally optimum detection for Barni’s multiplicative watermarking in DWT domain,” Signal Processing, vol. 88, pp. 117130, Jan. 2008. ##[32] S. Vassilios and P. Ioannis, “Optimal Detector for Multiplicative Watermarks Embedded in the DFT Domain of NonWhite Signals,” EURASIP Journal on Advances in Signal Processing, vol. 1900, no. 16, pp. 25222532, 2004. ##[33] T. Ng and H. Garg, “Maximum Likelihood Detection in Image Watermarking Using Generalized Gamma Model,” in Conference Record of the ThirtyNinth Asilomar Conference on Signals, Systems and Computers, no. 2, pp. 16801684, 2006. ##[34] M. Akhaee, N. KhademiKalantari, and F. Marvasti, “Robust Audio and Speech Watermarking Using Gaussian and Laplacian Modeling,” Signal Processing, vol. 90, pp. 24872497, Aug. 2010. ##[35] M. A. Akhaee, M. E. Sahraeian, and F. Marvasti, “Contourletbased image watermarking using optimum detector in a noisy environment.,” IEEE transactions on image processing : (a publication of the IEEE Signal Processing Society), vol. 19, pp. 96780, Apr. 2010. ##[36] R. Narayanan, S. Ponnappan, and SE, “Effects of uncorrelated and correlated noise on image information content,” REMOTE SENSING, no. C, pp. 70317033, 2001. ##[37] A. B. Watson, G. Y. Yang, J. a. Solomon, and J. Villasenor, “Visibility of Wavelet Quantization Noise,” Image Processing, IEEE Transactions on, vol. 6, pp. 116475, Aug. 2002. ##[38] E. Lam, “Statistical modeling of the wavelet coefficients with different bases and decomposition levels,” in Vision, Image and Signal Processing, IEE Proceedings, vol. 151, pp. 203206, 2004. ##[39] K. Mihcak, I. Kozintsev, K. Ramchandran, and P. Moulin, “Low Complexity Image Denoising Based On Statistical Modeling of Wavelet Coefficients,” Signal Processing Letters, IEEE, vol. 6, no. 12, pp. 300303, 1999. ##[40] A. Petrosian and F. Meyer, Wavelets in Signal and Image Analysis: From Theory to Practice. Computational Imaging and Vision, Springer, ##[41] [Available], “http://www.irisa.fr/vista/actions/hollywood2.” ##[42] S. Tai and S. Yang, “A fast method for image noise estimation using laplacian operator and adaptive edge detection,” in Communications, Control and Signal Processing, ISCCSP, 3rd International Symposium on, no. March, pp. 10771081, Mar. 2008. ##[43] C. Liu, W. Freeman, R. Szeliski, and S. Kang, “Noise estimation from a single image,” in Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, vol. 1, pp. 901908, 2006. ##[44] D. Donoho and J. Johnstone, “Ideal Spatial Adaptation By Wavelet Shrinkage,” Biometrika, vol. 81, no. 3, p. 425, 1994. ##[45] R. K. Pearson, Exploring data in engineering, the sciences, and medicine. Oxford; New York: Oxford University Press, 2011. ##[46] X. Gong and H. Lu, “Towards fast and robust watermarking scheme for H. 264 video,” in 10th IEEE International Symposium on Multimedia, pp. 649653, Dec. 2008. ##[47] L. Zhang, Y. Zhu, and L.M. Po, “A novel watermarking scheme with compensation in bitstream domain for H.264/AVC,” in IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 17581761, IEEE, 2010. ##[48] X. Gong and H.M. Lu, “Towards Fast and Robust Watermarking Scheme for H.264 Video,” in Tenth IEEE International Symposium on Multimedia, pp. 649653, IEEE, Dec. 2008. ##[49] F. Hartung and B. Girod, “Watermarking of uncompressed and compressed video,” Signal Processing, vol. 66, pp. 283301, May 1998. ##[50] D. Xu, R. Wang, and J. Wang, “Video watermarking based on spatiotemporal JND profile,” Digital Watermarking, vol. 5450, pp. 327 341,2009. ##[51] M. Bahoura and H. Ezzaidi, “Realtime implementation of discrete wavelet transform on FPGA,” in IEEE 10th INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, pp. 191 194, IEEE, Oct. 2010. ##[52] R. Jiang and D. Crookes, “FPGA implementation of 3D discrete wavelet transform for realtime medical imaging,” in Circuit Theory and ##Design, ECCTD. 18th European Conference on, pp. 519522, 2007. ##]
Image encryption based on chaotic tent map in time and frequency domains
2
2
The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase of the plain image. This change in the frequency domain causes changes in the pixels value and shuffles the pixels location in the time domain. Finally, in the time domain, a pseudo random image is produced using a chaotic tent map, to be combined to the image generated through the first step, and thus the final encrypted image is created. A computer simulation is also utilized to evaluate the proposed algorithm and to compare its results to images encrypted by other methods. The criteria for these comparisons are chisquare test of histogram, correlation coefficients of pixels, NPCR (number of pixel change rate), UACI (unified average changing intensity), MSE (mean square error) and MAE (mean absolute error), key space, and sensitivity to initial condition. These comparisons reveal that the proposed chaotic image encryption method shows a higher performance, and is of more secure.
1

97
110


E.
Hassani
Iran
e.hasani@srbiau.ac.ir


M.
Eshghi
Iran
meshghi@sbu.ac.ir
Image Encryption
Chaotic Tent Map
Key Image
Frequency Domain
Time Domain
[[1] E. Hasani, M. Eshghi, “Chaotic Image Encryption In Time and Frequency Domain”, 7th Iranian Machine Vision & Image Processing, IEEE conference, 2011. ##[2] H. S. Kwok and W. K. S. Tang, “A Fast Image Encryption System Based on Chaotic Maps with Finite Precision Representation”, J. of Chaos, Solitons & Fractals, vol. 32, pp. 15181529, 2007. ##[3] Y. Wang, K. W. Wong, X. Liao and G. Chen, “A New Chaosbased Fast Image Encryption Algorithm”, J. of Applied Soft Computing, Vol. 11, Issue 1, pp. 514522, 2011. ##[4] S. Sam, P. Devaraj and R. S. Bhuvaneswaran, “A Novel Image Cipher based on Mixed Transformed Logistic Maps”, J. of Multimedia Tools and Applications, Vol. 56, pp. 315330, 2012. ##[5] Kwok Sin Hung, “A Study On Efficient Chaotic Image Encryption Schemes”, Department of Electronic Engineering, CITY UNIVERSITY OF HUNG KONG, 2007. ##[6] Sh. lian, “MultiMedia Content encryption”, Taylor & Francis Group, 2009. ##[7] S. M. Seyedzadeh and S. Mirzakuchaki, “A Fast Color Image Encryption Algorithm based on Coupled TwoDimensional Piecewise Chaotic Map”, J. of Signal Processing, Vol. 92, pp.1202 1215, 2012. ##[8] Y. Mao, G. Chen, and S. Lian, “A novel Fast Image Encryption Scheme Based on 3D Chaotic Baker Maps”, International Journal of Bifurcation and Chaos, vol.14, no.10, pp. 36133624, 2004. ##[9] Q. Zhou, Kwo. Wong, X. Liao, T. Xiang and Y. Hu, “Parallel image encryption algorithm based on discretized chaotic map”, Chaos, Solitons & Fractals, vol. 38, pp. 10811092, 2008. ##[10] X. Zhang, C. Weibin “A New Chaotic Algorithm for Image Encryption”, ICLIP2008, IEEE conference, 2008. ##[11] S.E. Borujeni and M. Eshghi, “Chaotic Image Encryption Design Using TompkinsPaige Algorithm”, J. of Mathematical Problems in Engineering, 2009. ##[12] H. Khanzadi, M. Eshghi, “Image Encryption Using Random Bit Sequence Based on Chaotic Maps”, submitted to International Journal of Bifurcation and Chaos, 2012. ##[13] Sh. Liu, J.Sun, Zhe. Xu, J. Liu, “Analysis on an Image Encryption Algorithm”, IEEE Computer society, 2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing. ##[14] Ch.Weibin, X. Zhang, “Image Encryption Algorithm Based on Henon Chaotic System”, IEEE, 2009. ##[15] K. T. Alligood, T. D. Sauer, J. A. Yorke, “CHAOS: An Introduction to Dynamical Systems”, Corrected third printing 2000, SpringerVerlag, New York, 1996. ##[16] STEVEN H. STROGATZ, “Nonlinear Dinamics AND Chaos”, Perseus Books Publishing, 1994. ##[17] H. G. Schuster and Wolfram Just, “Deterministic Chaos”, Fourth, Revised and Enlarged Edition, WILEYVCH Verlag GmbH & Co, 2005. ##[18] Y. Hengfu, W. Yanpeng and T. Zuwei, “An Image Encryption Algorithm Based on Logistic Chaotic Maps and Arnold Transform”, J. of Hengshui University, pp. 4043, 2008. ##[19] H. Khanzadi, M. A. Omam, F. Lotfifar and M. Eshghi “Image Encryption Based on Gyrator Transform Using Chaotic Maps”, Signal Processing (ICSP) conference, China, 2010. ##[20] Gonzalez and Wood, “Digital Image Processing”, 3rd edition, Prentice Hall, 2008. ##[21] Y. Wang, K. W. Wong, X. Liao and G. Chen, “A New Chaosbased Fast Image Encryption Algorithm”, J. of Applied Soft Computing, Vol. 11, Issue 1, pp. 514522, 2011. ##[22] G. Zhang and Q. Liu, “A Novel Image Encryption Method based on Total Shuffling Scheme”, J. of Optics Communications, Vol. 284, pp. 27752780, 2011. ##[23] X. Zhang and W. Chen, “A New Chaotic Algorithm for Image Encryption”, ICALIP, pp. 889892, 2008. ##[24] H. Gao, Y. Zhang, S. Liang and D. Li, “A new chaotic algorithm for image encryption”, J. of Chaos, Solitons & Fractals, vol. 29, pp. 393399, 2006. ##[25] Y. Wang, K. W. W, X. L and G. C, “A new chaosbased fast image encryption algorithm”, J. of Applied Soft Computing, vol. 11, pp. 514522, 2009.##]
Persian Abstract
2
2
1

111
116