• Title/Summary/Keyword: Security solution

Search Result 1,000, Processing Time 0.033 seconds

Stackelberg Game between Multi-Leader and Multi-Follower for Detecting Black Hole and Warm Hole Attacks In WSN

  • S.Suganthi;D.Usha
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.159-167
    • /
    • 2023
  • Objective: • To detect black hole and warm hole attacks in wireless sensor networks. • To give a solution for energy depletion and security breach in wireless sensor networks. • To address the security problem using strategic decision support system. Methods: The proposed stackelberg game is used to make the spirited relations between multi leaders and multi followers. In this game, all cluster heads are acts as leaders, whereas agent nodes are acts as followers. The game is initially modeled as Quadratic Programming and also use backtracking search optimization algorithm for getting threshold value to determine the optimal strategies of both defender and attacker. Findings: To find optimal payoffs of multi leaders and multi followers are based on their utility functions. The attacks are easily detected based on some defined rules and optimum results of the game. Finally, the simulations are executed in matlab and the impacts of detection of black hole and warm hole attacks are also presented in this paper. Novelty: The novelty of this study is to considering the stackelberg game with backtracking search optimization algorithm (BSOA). BSOA is based on iterative process which tries to minimize the objective function. Thus we obtain the better optimization results than the earlier approaches.

Building On/off Attacks Detector for Effective Trust Evaluation in Cloud Services Environment

  • SALAH T. ALSHAMMARI;AIIAD ALBESHRI;KHALID ALSUBHI
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.7
    • /
    • pp.101-107
    • /
    • 2024
  • Cloud computing is a widely used technology that has changed the way people and organizations store and access information. This technology is quite versatile, which is why extensive amounts of data can be stored in the cloud. Furthermore, businesses can access various services over the cloud without having to install applications. However, the cloud computing services are provided over a public domain, which means that both trusted and non-trusted users can access the services. Though there are several advantages of cloud computing services, especially to business owners, various challenges are also posed in terms of the privacy and security of information and online services. A kind of threat that is widely faced in the cloud environment is the on/off attack. In this kind of attack, a few entities exhibit proper behavior for a given time period to develop a highly a positive reputation and gather trust, after which they exhibit deception. A viable solution is provided by the given trust model for preventing the attacks. This method works by providing effective security to the cloud services by identifying malicious and inappropriate behaviors through the application of trust algorithms that can identify on-off attacks.

Job Analysis for IT Security Workers in Defense Industry through DACUM Process (DACUM 기법을 이용한 방위산업체 정보통신보안실무자 직무분석)

  • Woo, Kwang Jea;Song, Hae-Deok
    • Convergence Security Journal
    • /
    • v.14 no.4
    • /
    • pp.73-84
    • /
    • 2014
  • As the society turns into more of an information an technology centric society, the importance of information security is being increased these days. Recently, as the number of leaking accidents of personal information and valuable industrial technology is on the rise, every field of industry endeavors to come up with a security solution. In particular, since defense industry is a field where it establishes national defense power that is essential of national security, it requires higher standards of security solutions than any other ordinary fields of industry. According to Defense Industry Security Work Instructions, defense industry firms from security organizations and employ a security worker corresponding to the firm's scale and conditions. In an environment where essential information and technology are stored and managed in information and communication system or storing media, the duty and role of IT security workers are crucial. However, there is a shortage of systematic analysis on the work of IT security workers and development of curriculum to enhance their professionalism. Thus DACUM process, a job analysis technique, was used to identify IT Security workers' duties and responsibilities and verify the validity and credibility of the deducted results from the survey. The findings of this study will help in development of IT security duty in defense industry and can be used as baseline data for the development of curriculum and amendments of related regulations.

A Study on the Algorithms for One-way Transmission in IPv6 Environment (IPv6 환경에서의 일방향 통신 알고리즘에 대한 연구)

  • Koh, Keun Ho;Ahn, Seong Jin
    • Convergence Security Journal
    • /
    • v.17 no.5
    • /
    • pp.63-69
    • /
    • 2017
  • In the early 1990s, IETF(Internet Engineering TaskForce) had started the discussion on new address protocol that can modify and supplement various drawbacks of existing IPv4 address protocol with the introduction of CIDR(Classless Inter-Domain Routing) which is a temporary solution for IPv4 address depletion, NAT, private IP address. While various standards related to new address protocol has been proposed, the SIPP(Simple Internet Protocol Plus) was adopted among them because it is regarded as the most promising solution. And this protocol has been developed into current IPv6. The new concepts are introduced with modifying a lot of deficiencies in the exisitng IPv4 such as real-time data processing, performance on QoS, security and the efficiency of routing. Since many security threats in IPv6 environment still exist, the necessity of stable data communication environment has been brought up continuously. This paper deveopled one-way communication algorithm in IPv6 based on the high possibility of protecting the system from uncertain and potential risk factors if the data is transmitted in one way. After the analysis of existing IPv6 and ICMPv6, this paper suggests one-way communication algorithm as a solution for existing IPv6 and ICMPv6 environment.

A Solution of Binary Jamming Message to Source-Wiretapping and Disadvantage of Sharing the Jamming Signal in Physical-Layer Security (물리 계층에서 보안 재밍 신호 공유의 한계점과 이진 재밍 메시지 도청의 해결책)

  • Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.63-67
    • /
    • 2014
  • A distributed zero-beamforming based cooperative jamming technique is useless when an eavesdropper detects the sharing seed. In addition, the currently alternatives are very limited when the eavesdropper is located nearby a source for wiretapping. This letter presents a solution to this extreme case. Relay randomly generates and transmits a binary jamming message to both source and destination in the first phase. When these two receivers securely and correctly decode the message, the source creates and transmits another message based on the use of exclusive-or for its information message and the decoded message. Consequently, the next transmission can avoid the eavesdropping.

Efficient Top-k Join Processing over Encrypted Data in a Cloud Environment

  • Kim, Jong Wook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.5153-5170
    • /
    • 2016
  • The benefit of the scalability and flexibility inherent in cloud computing motivates clients to upload data and computation to public cloud servers. Because data is placed on public clouds, which are very likely to reside outside of the trusted domain of clients, this strategy introduces concerns regarding the security of sensitive client data. Thus, to provide sufficient security for the data stored in the cloud, it is essential to encrypt sensitive data before the data are uploaded onto cloud servers. Although data encryption is considered the most effective solution for protecting sensitive data from unauthorized users, it imposes a significant amount of overhead during the query processing phase, due to the limitations of directly executing operations against encrypted data. Recently, substantial research work that addresses the execution of SQL queries against encrypted data has been conducted. However, there has been little research on top-k join query processing over encrypted data within the cloud computing environments. In this paper, we develop an efficient algorithm that processes a top-k join query against encrypted cloud data. The proposed top-k join processing algorithm is, at an early phase, able to prune unpromising data sets which are guaranteed not to produce top-k highest scores. The experiment results show that the proposed approach provides significant performance gains over the naive solution.

Intelligent Route Construction Algorithm for Solving Traveling Salesman Problem

  • Rahman, Md. Azizur;Islam, Ariful;Ali, Lasker Ershad
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.4
    • /
    • pp.33-40
    • /
    • 2021
  • The traveling salesman problem (TSP) is one of the well-known and extensively studied NPC problems in combinatorial optimization. To solve it effectively and efficiently, various optimization algorithms have been developed by scientists and researchers. However, most optimization algorithms are designed based on the concept of improving route in the iterative improvement process so that the optimal solution can be finally found. In contrast, there have been relatively few algorithms to find the optimal solution using route construction mechanism. In this paper, we propose a route construction optimization algorithm to solve the symmetric TSP with the help of ratio value. The proposed algorithm starts with a set of sub-routes consisting of three cities, and then each good sub-route is enhanced step by step on both ends until feasible routes are formed. Before each subsequent expansion, a ratio value is adopted such that the good routes are retained. The experiments are conducted on a collection of benchmark symmetric TSP datasets to evaluate the algorithm. The experimental results demonstrate that the proposed algorithm produces the best-known optimal results in some cases, and performs better than some other route construction optimization algorithms in many symmetric TSP datasets.

On the Need for Efficient Load Balancing in Large-scale RPL Networks with Multi-Sink Topologies

  • Abdullah, Maram;Alsukayti, Ibrahim;Alreshoodi, Mohammed
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.212-218
    • /
    • 2021
  • Low-power and Lossy Networks (LLNs) have become the common network infrastructure for a wide scope of Internet of Things (IoT) applications. For efficient routing in LLNs, IETF provides a standard solution, namely the IPv6 Routing Protocol for LLNs (RPL). It enables effective interconnectivity with IP networks and flexibly can meet the different application requirements of IoT deployments. However, it still suffers from different open issues, particularly in large-scale setups. These include the node unreachability problem which leads to increasing routing losses at RPL sink nodes. It is a result of the event of memory overflow at LLNs devices due to their limited hardware capabilities. Although this can be alleviated by the establishment of multi-sink topologies, RPL still lacks the support for effective load balancing among multiple sinks. In this paper, we address the need for an efficient multi-sink load balancing solution to enhance the performance of PRL in large-scale scenarios and alleviate the node unreachability problem. We propose a new RPL objective function, Multi-Sink Load Balancing Objective Function (MSLBOF), and introduce the Memory Utilization metrics. MSLBOF enables each RPL node to perform optimal sink selection in a way that insure better memory utilization and effective load balancing. Evaluation results demonstrate the efficiency of MSLBOF in decreasing packet loss and enhancing network stability, compared to MRHOF in standard RPL.

Optimization of the Travelling Salesman Problem Using a New Hybrid Genetic Algorithm

  • Zakir Hussain Ahmed;Furat Fahad Altukhaim;Abdul Khader Jilani Saudagar;Shakir Khan
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.3
    • /
    • pp.12-22
    • /
    • 2024
  • The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

An IoT-Aware System for Managing Patients' Waiting Time Using Bluetooth Low-Energy Technology

  • Reham Alabduljabbar
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.3
    • /
    • pp.83-92
    • /
    • 2024
  • It is a common observation that whenever any patient arrives at the front desk of a hospital, outpatient clinic, or other health-associated centers, they have to first queue up in a line and wait to fill in their registration form to get admitted. The long waiting time without any status updates is the most common complaint, worrying health officials. In this paper, UrNext, a location-aware mobile-based solution using Bluetooth low-energy (BLE) technology, is presented to solve the problem. Recently, a technology-oriented method has been gaining popularity in solving the healthcare sector's problems, namely the Internet of Things (IoT). The implementation of this solution could be explained through a simple example that when a patient arrives at a clinic for her consultation. There, instead of having to wait in long lines, she will be greeted automatically, receive a push notification telling her that she has been admitted along with an estimated waiting time for her consultation session. This will not only provide the patients with a sense of freedom but would also reduce uncertainty levels that are generally observed, thus saving both time and money. This work aimed to improve clinics' quality of services and organize queues and minimize waiting times in clinics, leading to patient comfortability and reducing the burden on nurses and receptionists. The results demonstrated that the presented system was successful in its performance and helped achieve high usability.