Data security over the Internet communication is the prime concern in this technological fast era. One of the major and fruitful security techniques is data encryption with keys. The efficiency of the encryption depends on the resistance ability of the encryption key. This paper presents an attack resistant symmetric key encryption model. In this paper, the threshold cryptographic technique provides a reliable and robust key and cipher text management system. The novelty of this system is it reconstructs the key and cipher text even in the case of destruction of difference between total shares and threshold shares on the contrary end. Thus secret sharing with symmetric key provides a robust encryption technique. The implemented symmetric key is the unique group symmetric key. The existing techniques available in world lead to high computational complexity during both sharing and reconstructing of plain text. A proposed masking method, share generation using that mask and transmission has been deployed. The symmetric key is used to impose proposed authenticity of data by implementation of the proposed key expansion technique. A secret sharing technique along with conventional cryptography technique for symmetric key validation and management make this methodology more robust. Statistical type of test results proves the robustness of our technique.

Secret Sharing, Key Expansion, Symmetric key encryption

[1]. Stallings William ,“Cryptography and Network Security”, Pearson India Education Service Pvt. Ltd., pp.111-155, 2015.
[2]. Preeti Singh et al, “Symmetric Key Cryptography: Current Trends”, International Journal of Computer Science and Mobile Computing, Vol.3 Issue.12, pp. 410-415, 2014.
[3]. G.R. Blakley, “Safeguarding cryptographic key”, In Proceedings of AFIPS International Worhshop on Managing Requirements Knowledge, pp. 313, 1979.
[4]. Shamir: “How to share a secret?”,Comm ACM 22(11): 612-613, 1979.
[5]. A. De Santis, Y. Desmedt, Y. Frankel and Y. Yung “How to share a function securely?” ,In proceeding of STOC 94, pp. 522-533, 1994.
[6]. C. Asmuth and J.Bloom, “A modular to key safeguarding”, IEEE Transaction on Information Theory, vol.29, no. 2, pp. 208-210, 1983.
[7]. Prabir Kr. Naskar, Hari Narayan Khan, Ayan Chaudhuri, Atal Chaudhuri “Ultra Secured and Authentic Key Distribution Protocol using a Novel Secret Sharing Technique”, International Journal of Computer Applications (0975 – 8887) Volume 19– No.7, April 2011.
[8]. Y. Desmedt “Some recent research aspects of threshold Cryptography”,In proceeding of ISW’97 1st International Information Security Workshop vol.1196 of LNCS pp. 158-173 Springer-Verlag 1997.
[9]. H. F. Hua ng and C.C. Chang A “novel efficient (t, n) threshold proxy signature scheme”, Information Sciences 176(10): 1338-1349, 2006.
[10]. A. Peinado, J. Munilla, and A. F ´uster-Sabater. EPCGen2 Pseudorandom Number Generators: Analysis of J3Gen. Sensors, 14(4):6500-6515, 2014
[11]. F. Zheng, X. Tian, J. Song, and X. Li. “Pseudo-random sequence generator based on the generalized henon map”, The Journal of China Universities of Posts and Telecommunications, 15(3):pp.64–68, 2008.