|
Multiple Server Based Sharing And Secured Data Management By Intrusion Detection System
[Full Text]
AUTHOR(S)
Dr. Rekha Patil, Asmita Kadechur
KEYWORDS
Adhoc On Demand Distance Vector, Intrusion detection system, Honeypot node, Radcloud, Route Request, Route Reply, Slepian-Wolf Code.
ABSTRACT
The user information has gained the higher interest as to communication has increased between the end users. The data manipulation has been the key aspect in the real time data exchange. The data increases exponentially hence the use of the storage location such as cloud or remote database has been developed. The storing and retrieving of the data has been challenged by the security threats. In this paper, for data transmission the use of the Routing protocol like AODV with the IDS technology and Slepian Wolf coding methods have been used for the data encoding and decoding. The dynamic multipath routing has been enabled to re-route in case of the attack. The system works under multiple scenario for the user need. In the attacking scenario, on detection of the honeypot node, the network is re-routed and repaired which results in achieving an optimal efficiency by adopting the Network Intrusion Detection System (NIDS) in the Trusted Network. The proposed concept of trace, repair or re-route has been a novel approach for secured and assured data manipulation in the cloud database.
REFERENCES
[1] A. Shamir, “How to share a secret”, Communication of the ACM, vol. 22, no. 11, pp. 612-613, 1979.
[2]B. Fortescue, and G. Gour, “Reducing the Quantum Communication Cost of Quantum Secret Sharing”, IEEE Trans. Inf. Theory, no. 58, no. 10, pp. 6659-6666, 2012.
[3] O.Farras, T.Hansen, T.Kaced, and C.Padro ,“Optimal Non-perfect Uniform Secret Sharing Schemes”,34thCryptologyConf.onAdvances in Cryptology (CRYPTO’14), pp. 217-234, 2014.
[4] J. Li, X. Chen, M. Li, J. Li, P.P.C. Lee, and W. Lou, “Secure Deduplication with Efficient and Reliable Convergent Key Management”, IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 6, pp. 1615-1625, 2014.
[5] [13] L. Chunli, X. Jia, L. Tian, J. Jing, and M. Sun, “Efficient Ideal Threshold Secret Sharing Schemes Based on EXCLUSIVE-OR Operations”, 4th Conf. on Network and System Security (NSS’10), pp. 136-143, 2010.
[6] J. Chen, D.K. He, A. Jagmohan, L.A.L. Montano, “On the linear codebook-level duality between Slepian-Wolf coding and channel coding”, IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5575-5590, 2009.
[7] E. Abbe, “Randomness and Dependencies Extraction via Polarization, With Applications to SlepianWolf Coding and Secrecy”, IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2388-2398, 2015.
[8] C. Cheng, J. Lee, T. Jiang, and T. Takagi, “Security Analysis and Improvements on Two Homomorphic Authentication Schemes for Network Coding”, IEEE Trans. Inf. Forensics Security, vol. 11, no. 5, pp. 993-1002, 2016.
[9] C. Cheng, and T. Jiang, “An Efficient Homomorphic MAC with Small Key Size for Authenticationin Network Coding” ,IEEE Trans. Comput., vol. 62, no. 10, pp. 2096-2100, 2012.
[10] R. Johnson, D. Molnar, D. Song, and D. Wagner, “Homomorphic Signature Schemes”, Cryptographer’s Track at the RSA Conf. on Topics in Cryptology (CT-RSA), pp.244-262, 2002.
[11] C. Cheng, J. Lee, T. Jiang, and T. Takagi, “Security Analysis and Improvements on Two Homomorphic Authentication Schemes for Network Coding”, IEEE Trans. Inf. Forensics Security, vol. 11, no. 5, pp. 993-1002, 2016.
[12] S. Gorbunov, V. Vaikuntanathan, and D. Wichs, “Leveled Fully Homomorphic Signatures from Standard Lattices”, 47th ACM symposium on Theory of computing (STOC’15), pp. 469-477, 2015.
[13] D. Freeman, “Improved security for linearly homomorphic signatures: a generic framework”, 15th conf. on Practice and Theory in Public Key Cryptography (PKC’12), pp. 697-714, 2012.
[14] B. Chen, R. Curtmola, G. Ateniese and R. Burns, “Remote Data Checking for Network Coding-based Distributed Storage Systems”,2nd ACM Cloud Computing Sec .Workshop(CCSW’10),pp.31-42,2010
|
