期刊文献+

A New Compression Scheme for Secure Transmission

A New Compression Scheme for Secure Transmission
原文传递
导出
摘要 Encryption techniques ensure security of data during transmission. However, in most cases, this increases the length of the data, thus it increases the cost. When it is desired to transmit data over an insecure and bandwidth-constrained channel, it is customary to compress the data first and then encrypt it. In this paper, a novel algorithm, the new compression with encryption and compression (CEC), is proposed to secure and compress the data. This algorithm compresses the data to reduce its length. The compressed data is encrypted and then further compressed using a new encryption algorithm without compromising the compression efficiency and the information security. This CEC algorithm provides a higher compression ratio and enhanced data security. The CEC provides more confidentiality and authentication between two communication systems. Encryption techniques ensure security of data during transmission. However, in most cases, this increases the length of the data, thus it increases the cost. When it is desired to transmit data over an insecure and bandwidth-constrained channel, it is customary to compress the data first and then encrypt it. In this paper, a novel algorithm, the new compression with encryption and compression (CEC), is proposed to secure and compress the data. This algorithm compresses the data to reduce its length. The compressed data is encrypted and then further compressed using a new encryption algorithm without compromising the compression efficiency and the information security. This CEC algorithm provides a higher compression ratio and enhanced data security. The CEC provides more confidentiality and authentication between two communication systems.
出处 《International Journal of Automation and computing》 EI CSCD 2013年第6期578-586,共9页 国际自动化与计算杂志(英文版)
关键词 Data compression encryption algorithm compression with encryption and compression (CEC) algorithm Huffmancoding run length coding bits per character (BPC). Data compression, encryption algorithm, compression with encryption and compression (CEC) algorithm, Huffmancoding, run length coding, bits per character (BPC).
  • 相关文献

参考文献28

  • 1V. K. Govindan, B. S. Shajeemohan. Compression scheme for faster and secure data transmission over networks. In Proceedings of the International Conference on Mobile Business, IEEE Computer Society Washington, DC, USA, pp. 678-681, 2005.
  • 2D. Klinc, C. Hazay. A. Jagmohan, H. Krawczyk, T. Rabin. On compression of data encrypted with block ciphers. In Proceedings of Data Compression Conference, IEEE, Snow- bird, UT, USA, pp. 213-222, 2009.
  • 3T. M. Mahmoud, B. A. Abdel-latef, A. A. Ahmed, A. M. Mahfouz. Hybrid compression encryption technique for se- curing SMS. International Journal of Computer Science and Security, vol. 3, no. 6, pp. 473 482, 2010.
  • 4R. E. L. Metzler, S. S. Agaian. Cipherstream covering for secure data compression. In Proceedings of IEEE Inter- national Conference on Systems, Man, and Cybernetics, IEEE, Anchorage, AK, USA, pp. 3370 3377, 2011.
  • 5J. Daemen, V. Rijmen. The Design of Rijndael: AES-the Advanced Encryption Standard, New York: Springer, 2002.
  • 6M. Abdalla, M. Bellare, D. Catalano, t. Kiltz, T. Kohn, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. X. Shi. Searchable encryption revisited: Consistency properties, re- lation to anonymous IBE, and extensions. Journal of Cryp- tology, vol. 21, no. 3, pp. 35(391, 2008.
  • 7G. S. W. Yeo, R. C. W. Phan. On the security of the Win- RAR encryption feature. International Journal of Informa- tion Security, vol. 5, no. 2, pp. 115-123, 2006.
  • 8H. Kim, J. T. Wen, J. D. Villasenor. Secure arithmetic cod- ing. IEEE Transactions on Signal Processing, vol. 55, no. 5, pp. 2263 2272, 2007.
  • 9H. Kaplan, E. Verbin. Most Burrows-Wheeler based com- pressors are not optimal. Combinatorial Pattern Match- ing, Lecture Notes in Computer Science, Berlin, Heidelberg: Springer-Verlag, vol. 4580, pp. 107-118, 2007.
  • 10v v. T. Gagie, G. Manzini. Move-to-front, distance coding, and inversion frequencies revisited. Combinatorial Pattern Matching, Lecture Notes in Computer Science, Berlin, Hei- delberg: Springer-Verlag, vol. 4580, pp. 71-82, 2007.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部