Information Security Using Chains Matrix Multiplication

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (volume 167)

Abstract

Information technology is facing lots of problems, while transmitting sensitive data and confidential data due to rapid growth of technology. The sensitive data is intended to share between only authorized persons, not for all. Information security concentrates on sensitive knowledge pattern that can be exposed when extracting the data. Therefore, researchers, for a long time period, have been investigating paths to improve privacy for sensitive data in information security analysis task process. So, many techniques have been introduced on privacy preserving issues in information security by using cryptography, steganography and their combination. In this paper we proposed an effective and efficient approach based on cryptography and Chains Matrix Multiplication (CMM) steganography uses optimal substructure property for generating random key to hide the data. It has to be improved privacy of sensitive data in information security analysis.

Keywords

Information security CMM optimal substructure property random key 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wang, Y., Desmedt, Y.: Perfectly Secure Message Transmission Revisited. IEEE Transactions on Informaiton Theory 54(6), 2582–2596 (2008)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bellovin, S.M., et al.: Risking Communications Security: Potential Hazards of the Protect America Act 6(1), 24–33 (2008)Google Scholar
  3. 3.
    O’Melia, S., Elbirt, A.J.: Enhancing the Performance of Symmetric-Key Cryptography via Instruction Set Extensions. IEEE Trans. VLSI Syst. 18(11), 1505–1518 (2010)CrossRefGoogle Scholar
  4. 4.
    Cachin, C., Camenisch, J.: Encrypting Keys Securely. IEEE Security & Privacy, 66–69 (2010)Google Scholar
  5. 5.
    Lin, C.-C., Tsai, W.-H.: Secret image sharing with steganography and authentication. The Journal of Systems and Software, 405–414 (2004)Google Scholar
  6. 6.
    Westfeld, A., Pfitzmann, A.: Attacks on Stegano graphic Systems. In: Proceedings of the 3rd International Conference on Information Systems Security, pp. 16–20. ACM (2007)Google Scholar
  7. 7.
    Dumitrescu, S., Wu, X., Memon, N.: On steganalysis of random lsb embedding in continuous-tone images. In: IEEE International Conference on Image Proces., pp. 641–644 (2002)Google Scholar
  8. 8.
    Chikalov, I., Hussain, S., Moshkov, M.: Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 157–165. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Hu, T.C., Shing, M.T.: Computation of matrix chain products. Part II. SIAM Journal on Computing 13(2), 228–251 (1984)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Bellman, R.: Dynamic Programming Treatment of the Travelling Salesman Problem. J. ACM 9(1), 61–63 (1962)MATHCrossRefGoogle Scholar
  11. 11.
    Dinur, L., Nissm, K.: Revealing Information while Preserving Privacy. In: Proceedings of 22nd ACM symposium on Principles of Database Systems, pp. 202–210 (2003)Google Scholar
  12. 12.
    Fridrich, J.J., Goljan, M.: On estimation of secret message length in LSB steganography in spatial domain, pp. 23–34 (2004)Google Scholar
  13. 13.
    Sharma, A., Ojha, V.: Implementation of Crypotography for Privacy Preserving Data mining. Proceedings of ITDMS 2(3) (2010)Google Scholar
  14. 14.
    Lindell, Y., Pintas, B.: Preserving Data mining. Jounal of Cryptology, 177–206 (2002)Google Scholar
  15. 15.
    Rupa, C., Avadhani, P.S.: Message Encryption Scheme Using Cheating Text. In: ITNG: Sixth International Conference on Information Technology: New Generations International Journal of Computer Science and Mathematical Applications (indexed by IEEE, dblp), pp. 470–475 (2009) ISBN: 978-0-7695-3596-8/09Google Scholar
  16. 16.
    Du, R., Guthrie, L.E., Buchy, D.: Steganalysis with JPEG and GIF images, pp. 98–104 (2004)Google Scholar
  17. 17.
    Agaian, S.S., Rodriguez, B.M., Dietrich, G.B.: Steganalysis using modified pixel comparison and complexity measure, pp. 46–57 (2004)Google Scholar
  18. 18.
    Yang, B., Schmucker, M., Funk, W., Busch, C., Sun, S.-H.: Integer DCT-based reversible watermarking for images using companding technique, pp, 404–415 (2004)Google Scholar
  19. 19.
    Bhowmik, B.: Simplified Optimal Parenthesization for matrix chain multi-plication problem using Bottom up practice in 2 – tree structure. J. of Applied Comp. Sc. & Math 11, 9–14 (2011)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Dept of CSEVVITNamburIndia
  2. 2.Dept of CS&SEAndhra UniversityVisakhapatnamIndia

Personalised recommendations