Refine your search
Collections
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sugumar, R.
- Optimization of Recent Attacks Using Internet Protocol
Abstract Views :238 |
PDF Views:2
Authors
Source
National Journal of System and Information Technology, Vol 5, No 1 (2012), Pagination: 8-24Abstract
The Internet threat monitoring (ITM) systems have been deployed to detect widespread attacks on the Internet in recent years. However, the effectiveness of ITM systems critically depends on the confidentiality of the location of their monitors. If adversaries learn the monitor locations of an ITM system, they can bypass the monitors and focus on the uncovered IP address space without being detected. In this paper, we study a new class of attacks, the invisible LOCalization (iLOC) attack. The iLOC attack can accurately and invisibly localize monitors of ITM systems. In the iLOC attack, the attacker launches low-rate port-scan traffic, encoded with a selected pseudo noise code (PN-code), to targeted networks. While the secret PN-code is invisible to others, the attacker can accurately determine the existence of monitors in the targeted networks based on whether the PN-code is embedded in the report data queried from the data center of the ITM system. We formally analyze the impact of various parameters on attack effectiveness. We implement the iLOC attack and conduct the performance evaluation on a real-world ITM system to demonstrate the possibility of such attacks. We also conduct extensive simulations on the iLOC attack using real-world traces. Our data show that the iLOC attack can accurately identify monitors while being invisible to ITM systems. Finally, we present a set of guidelines to counteract the iLOC attack.Keywords
Internet Threat Monitoring, Invisible Localization Attack, PN-code, Security, Attack Traffic, Traffic Rate
References
- Fariba Haddadi, Sara khanchi, Mehran Shetabi, and Vali Derhami (2010), ‘Intrusion Detection and Attack Classification Using Feed-Forward Neural Network’, Proceedings of 2nd International Conference on Computer and Network Technology, pp. 262-266.
- Ferrante A, Piuri V, and Castanier F (2005), ‘A QoS enabled packet scheduling algorithm for IPSec multi accelerator based systems’, Proceedings of the 2nd International Conference on Computing frontiers, pp. 221-229.
- Fineberg V (2002), ‘A practical architecture for implementing end-to-end QoS in an IP network’, IEEE Journal on Communication Magazine, Vol. 40, No. 1, pp. 122-130.
- Francis P, Handley M, Karp R, and Shenker S (2002), ‘A scalable contentaddressable network’, IEEE Journal on Information Computing, pp. 1190- 1199.
- Gao L (2001), ‘On inferring autonomous system relationships in the Internet’, IEEE Journal on Transactions of Networking, Vol. 9, No. 6, pp. 733-745.
- Ghandeharizadeh S, Song S, and Krishnamachari B (2004), ‘Placement of continuous media in wireless peer-to-peer networks’, Proceedings of International Conference on Transactions Multimedia, Vol. 6, Issue 2, pp. 335-342.
- Giaffreda (2001), ‘Name resolving and routing in mobile networks’, Proceedings of 2nd International Conference on 3G Mobile Communication Technologies, pp.191-195.
- Govindan R, Estrin D, and Silva F (2003), ‘Directed Diffusion for Wireless Sensor Networking’, IEEE Journal on Transactions of Networking, Vol. 11, No. 1, pp. 2-16.
- Haas, and Pearlman (2001), ‘The performance of query control schemes for the zone routing protocol’, ACM Journal on Transactions of Networking, Vol. 9, No. 4, pp. 427-438.
- Haim Zlatokrilov, and Hanoch Levy (2008), ‘Area avoidance routing in Distance-Vector networks’, IEEE Journal on Communication Society 2008, pp. 1148-1156.
- Heinzelman W, Kulik J, and Balakrishnan H (1999), ‘Adaptive protocols for Information Dissemination in Wireless Sensor Networks’, Proceedings of International Conference on Mobile Communication, pp. 174-185.
- Huayang Cao, Miao Wang, Xiaoqiang Wang, and Peidong Zhu (2009), ‘A Packet-based Anomaly Detection Model for Inter-domain Routing’, Proceedings of International Conference on Networking, Architecture, and Storage, pp.192-195.
- HuBaux, Buttyan, and Capkun (2001), ‘The quest for security in mobile ad hoc networks’, Proceedings of International Conference on Mobile host Communication, pp. 146-155.
- Jaideep Chandrashekar, Zhenhai Duan, and Xin Yuan (2006), ‘Controlling Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates’, IEEE Journal on Communications Society, pp.341-352.
- Jayanth, and Bharghavan (1998), ‘Performance of transport protocols over a multicasting based architecture for Internet host mobility’, IEEE Journal on Communication Society 1998, pp. 1817-1823.
- Jingyuan Li, Liusheng Huang, Weijia Jia, Mingjun Xiao, and Peng Du (2006), ‘Systems on the basis of WiMAX and Wi-Fi’, IEEE Journal on Communication Society, pp. 819-824.
- Jirapummin C, Wattanapongsakorn N, and Kanthamanon P (2002), ‘Hybrid neural networks for intrusion detection system’, Proceedings of International Conference on Circuits, Computers and Communications, pp. 928-931.
- Johnson D, Maltz A, and Broch J (2001), ‘DSR: The Dynamic Source Routing Protocol for Multi-hop Wireless Ad hoc Networks’, IEEE Journal on Ad hoc Networking, pp. 139-152.
- Empowering Security and Performance of TPA Pertinent in Single Cloud to Multi-Cloud
Abstract Views :155 |
PDF Views:3
Authors
Affiliations
1 Department of Computer Science, C. Abdul Hakeem College of Engineering and Technology, Melvisharam, Vellore District, Tamil Nadu, IN
2 Department of Information Technology, C. Abdul Hakeem College of Engineering and Technology, Melvisharam, Vellore District, Tamil Nadu, IN
1 Department of Computer Science, C. Abdul Hakeem College of Engineering and Technology, Melvisharam, Vellore District, Tamil Nadu, IN
2 Department of Information Technology, C. Abdul Hakeem College of Engineering and Technology, Melvisharam, Vellore District, Tamil Nadu, IN
Source
Wireless Communication, Vol 6, No 6 (2014), Pagination: 256-260Abstract
The use of cloud computing has increased rapidly in many organizations and it also deployed in technologies like 3G, 4G and pervasive applications. Ensuring the security of cloud computing is a major factor in the cloud computing environment as users often store sensitive information with cloud storage providers (CSP), but these providers may be untrusted. Even though a TPA audits the users data with correctness and integrity, dealing with single cloud providers is predicted to become less popular with service availability failure, possibility of malicious insiders and Byzantine faults in the single cloud. A movement towards Multi-Clouds or in other words inter-clouds or clouds- of- clouds has emerged recently; hence we need to protect the user data in Multi-Clouds with greater security in the form of public batch auditing and dynamic certification to perform continuous monitoring from single to Multi-Clouds, by this, it is to implement Cipher text – Policy Attribute Based Encryption(CP-ABE)[6] to achieve secure data sharing and also provides forward and data sharing and also provides forward and backward security in cloud computing to improve the security and performance with many number of users using the single to multi cloud environment.
Keywords
TPA (Third Party Auditor), CSP (Cloud Service Provider), CP-ABE (Cipher Text Policy Attribute based Encryption), TPACA (Third Party Auditor Certificate Authority).- Determining the Existence of Quantitative Association Rules in Data Mining
Abstract Views :149 |
PDF Views:3
Authors
Affiliations
1 Department of IT, RMDEC, Chennai, IN
2 Department of IT, Sree Sastha Institute of Technology, IN
3 Department of CSE, RMKEC, Chennai, IN
1 Department of IT, RMDEC, Chennai, IN
2 Department of IT, Sree Sastha Institute of Technology, IN
3 Department of CSE, RMKEC, Chennai, IN
Source
Data Mining and Knowledge Engineering, Vol 2, No 6 (2010), Pagination:Abstract
Determining the association rules is a core topic of data mining. This survey paper aims at giving an overview to some of the previous researches done in this topic, evaluating the current status of the field, and envisioning possible future trends in this area. The theories behind association rules are presented at the beginning. Comparison of different algorithms is provided as part of the evaluation.
- Conditional Entropy with Swarm Optimization Approach for Privacy Preservation of Datasets in Cloud
Abstract Views :148 |
PDF Views:0
Authors
R. Sabin Begum
1,
R. Sugumar
2
Affiliations
1 Research and Development Centre, Bharathiar University, Coimbatore - 641046, Tamil Nadu, IN
2 Department of Computer and Engineering, Velammal Institute of Technology, Chennai - 601204, Tamil Nadu, IN
1 Research and Development Centre, Bharathiar University, Coimbatore - 641046, Tamil Nadu, IN
2 Department of Computer and Engineering, Velammal Institute of Technology, Chennai - 601204, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 28 (2016), Pagination:Abstract
Background/Objective: The primary intension is to provide utility trade off and good privacy for intermediate datasets in cloud. Methods: An efficient conditional entropy and database difference ratio is employed for the process. Utility is taken care with the employment of conditional entropy with the help of Swarm Optimization (PSO). Privacy handled by database difference ratio. Findings: Conditional entropy is found out between the first column and the original database and this is taken as the fitness function in Particle Swarm Optimization (PSO). Database difference is taken between the original database and convoluted database in the consequent module to yield right selection data and tuple information from the intermediate datasets in cloud. Applications/Improvements: Improved methods are required to provide privacy and utility for the right selection of datasets. This approach has better results by having higher entropy values and lower dataset difference ratio.Keywords
Cloud Computing, Conditional Entropy, Database Difference Ratio, Intermediate Datasets, Particle Swarm Optimization (PSO), Privacy Preservation.Full Text
- A Proficient Two Level Security Contrivances for Storing Data in Cloud
Abstract Views :153 |
PDF Views:0
Authors
K. Anbazhagan
1,
R. Sugumar
2
Affiliations
1 Department of IT, St. Peter’s University, Chennai - 600082, Tamil Nadu, IN
2 Department of CSE, Velammal Institute of Technology, Chennai - 601204, Tamil Nadu, IN
1 Department of IT, St. Peter’s University, Chennai - 600082, Tamil Nadu, IN
2 Department of CSE, Velammal Institute of Technology, Chennai - 601204, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 48 (2016), Pagination:Abstract
Objectives: Cloud Computing provides vast storage facility. The requirement of this system is to improve the security and transmission performance in the cloud storage environment. Methods: This system provides two level of security for the cloud data. The Client Data Security Contrivance (CDSC) and Cloud Service Provider (CSP) Data Security Contrivance are the two methods which transforms the original data to cipher text. The security algorithm used in CDSC is Linguistic Steganography. Blowfish algorithm is used in CSP Data Security Contrivance to convert the cipher text using a secretkey block cipher of 64-bits. This system is designed to increase security and to improve the transmission performance. Storage-cheating attack model and Privacy-cheating attack model are implemented to protect the data on cloud. Findings: This system increases security and improves transmission performance. The blowfish algorithm is secure against unauthorized attacks and runs faster than the popular existing algorithms. Storage-cheating attack model and Privacy-cheating attack model provides the data confidentiality for data stored in the cloud in higher way. Improvements: The system can be implemented in real cloud system in the future.Keywords
Blowfish Algorithm, Cloud Computing, Data Storage in Cloud, Linguistic Steganography, Two Levels Security.Full Text