To protect the resources from various vulnerability factors, resources should have various routin... more To protect the resources from various vulnerability factors, resources should have various routine security mechanisms such as antivirus capability, firewall capability, usage of secure network connections, provision of execution sandbox, invoking dynamic checkpointing, and intrusion detection system-related capabilities. Security is one of the key issues in distributed computing systems like grid and cloud. Whole system is secured when resources have self-defense capability. Adapting security measures in grid environment is an expensive mechanism and leads to delays in service provisioning whereas trust can be, relatively, a simple and fast solution. In view of the interest of the users and quick delivery of the services by the provider, integration of different combinations of trust levels and security mechanisms can reduce the costs and delays involved in adapting security measures. This paper proposes a new approach for integrating security levels along with trust in general for distributed computing systems and in particular for grid computing systems. Our previous work proposed a T-grid computational model suitable for grid computing systems, which will be used for experimenting and testing the proposed idea of the integration. Results of the studies are produced.
The paper focuses on the software system developed for the proposed architecture of the grid mean... more The paper focuses on the software system developed for the proposed architecture of the grid meant for Indian rural health care system. The application developed would display various activities and functionalities. The application will consolidate the Infant and women health data at various grid levels i.e. at the village, mandal, city and district. The application helps a rural doctor to get the advice by a specialist doctor in the city for preventive health care.
2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2018
With the widespread usage of Cloud Computing model in business, organizations prefer to outsource... more With the widespread usage of Cloud Computing model in business, organizations prefer to outsource their data to the cloud. In order to preserve confidentiality of data, the data is encrypted before being outsourced. In order to use this encrypted data in decision making, symmetric searchable encryption is employed that enables users to fetch data matching the keywords over encrypted data without decrypting the data. Many existing schemes search for a single keyword without an index, leading to search time linear to the size of data. And moreover, support for multiple keyword searches or phrase search is also a trending challenge in the field of searchable encryption. In this paper, we extend the practical techniques for searches on encrypted data proposed by Song, et.al, by improving the search efficiency with help of an encrypted and dynamic index. We use a very efficient structure to enable dynamic updates to the index in event of changes to the encrypted dataset. Our proposed scheme is the first one to use such a simple yet update-efficient structure for index. Multi-phrase search being implemented helps in obtaining most representative documents for searches, especially in mobile devices. We also implemented and analyzed efficiency of Song et al scheme, which is one of the pioneering works in field of searchable encryption. Security analysis and extensive experiments were conducted to test the security guarantees and efficiency of the proposed extensions.
With the characteristic of spatial diversity and low cost, cooperative system is a tendency for t... more With the characteristic of spatial diversity and low cost, cooperative system is a tendency for the future communications. In the wireless communication system, there exist degradation factors such as signal fading, multipath transmission, signal inferences, bandwidth limitation and so on. In addition to these degradation factors, the wireless transmission is not a secure environment. The information might be leaked during the transmission. Currently , the issues of privacy and security have become increasingly important for the mobile users. Traditionally, the security scheme is applied to the higher network layer. Encryption can be complex and difficult without infrastructure. It is not suitable to apply to the equipment with low computing resources, such as Internet of Things (IoT) application. Within information theoretic security characterizes the fundamental ability of the physical layer to provide a secure transmission. Hence, this work concentrates on the secure cooperative ...
This paper focusses on proposing a system for grid based health care center. The paper dicusses t... more This paper focusses on proposing a system for grid based health care center. The paper dicusses the importance of health care center and grid computing. It also focusses on the proposed sytem architecture for the system which has to be built. We will also discuss about the needed scheduling algorithm in this paper that will run in the system and help in data sharing process. The numerous user interface screens states the kind of system we are about to develop.
2017 International Conference on Inventive Systems and Control (ICISC), 2017
Outsourcing of sensitive and critical data into third party thus untrusted service environments r... more Outsourcing of sensitive and critical data into third party thus untrusted service environments remains a serious security concern. In such environments, data needs to be protected throughout its lifecycle i.e. at-rest, in-transit and while-in-use. Data in third phase remains mostly unprotected as it demands operations to be performed over encrypted data while achieving semantics same as in case of plaintext data. This is a big challenge and thus data remains vulnerable in third phase when hosted in above environments. In this paper, we propose a novel solution to this challenge. We present a scheme on proximity-based-search on encrypted data when a majority of research is limited to exact-keyword-search only. We propose a novel scheme for proximity-based-search on encrypted databases hosted in untrusted service environments. This scheme involves a trusted proxy which facilitates a trapdoor to execute search queries over encrypted data while achieving perfect secrecy as well. It implements an idea of transitive Referential Dissimilarity over byte distances for each corresponding pair of bytes in any two given words. This technique is based on Levenshtein Distance. To the best of our knowledge, such a scheme has been proposed for the first time and it presents a two-point novelty. Firstly, it supports basic OLTP operations securely and seamlessly as evident in presented performance statistics. Secondly, it remains provably secure and practical towards real world application requirements as it does not demand any modifications to existing ecosystems.
Scheduling of jobs is one of the crucial tasks in grid environment. We consider non-preemptive sc... more Scheduling of jobs is one of the crucial tasks in grid environment. We consider non-preemptive scheduling of independent tasks in a computational grid. Recently, a general distributed scalable grid scheduler (GDS) was proposed, which prioritizes mission-critical tasks while maximizing the number of tasks meeting deadlines. However, the GDS scheduler did not consider the reliability factor, which may result in low successful schedule rates. In this paper, we propose a novel distributed grid scheduler which takes reliability factor (RDGS) into consideration with respect to the failure of grid nodes. The proposed scheduler invokes the tasks allocated to deficient grid nodes and maintains them in a queue. Further the queued tasks are rescheduled to the other nodes of the grid. It is observed that RDGS scheduler shows a significant improvement in terms of successfully scheduled tasks as compared to a variation of GDS without priority and deadlines (GDS-PD). The results of our exhaustive ...
International Journal of Advanced Research in Computer Science, 2017
Grid computing technology is a technique to share various resources like memory, storage, process... more Grid computing technology is a technique to share various resources like memory, storage, processor that are idle, to solve very huge and complex problems. These resources are shared among various heterogeneous computers, which form a virtual organization. The computers involved in communication for sharing resources might be from the same domain or from different domains. The risk is more in communication among computers from different domains since they are unknown to each other and there are more chances to misuse the resources. To avoid the above mentioned problems, various trust models are prepared to assess the computers for their trustworthiness in communication. This paper proposes a trust model, which uses a regression model to predict the behavior of client and service provider for further communication in a more secure manner. This regression model is developed based on the data collected through a survey; also, a reliability test was conducted to check the consistency of...
The main motivation of an attacker is to convince two far away nodes as neighbor nodes using worm... more The main motivation of an attacker is to convince two far away nodes as neighbor nodes using wormhole attack easily without the knowledge of cryptographic primitives. Thus, it can significantly degrade the performance of Wireless Mesh Networks (WMNs). Secure neighbor discovery is a fundamental requirement of network nodes to ensure secure data communication. An adversary that bypass neighbor discovery process of a legitimate node using wormhole attack can disrupt the overlying protocols and applications. In this paper, we propose a secure neighbor verification mechanism to thwart wormhole attack that can prevent bogus links from being involved in the network operations. It employs node ranking scheme to compute relative distance between neighbors and uses connectivity information to check the genuinity of neighborhood creation. We evaluate our mechanism using simulation to demonstrate the efficiency in the presence of wormholes.
Proceedings of the International Congress on Information and Communication Technology, 2016
A computational grid is an environment for achieving better performance and throughput by pooling... more A computational grid is an environment for achieving better performance and throughput by pooling geographically distributed heterogeneous resources dynamically depending on their availability, capability, performance, and cost and user quality of self-service requirement. Fault tolerant grid scheduling is a significant concern for computational grid systems. The handling of failures can happen either before or after scheduling tasks on grid resources. Generally, there are two approaches used for the handling of failures namely, post-active fault-tolerant approach and pro-active fault tolerant approach. Recently, a fault tolerant scheduler for grids proposed uses pro-active approach in selecting resources by computing scheduling indicator. However, this study did not considered failure of node while the task is being executed. Thus in our study, we incorporates post-active fault tolerant approach to the exiting study, i.e., migrating of task to another node in the event of failure of node while the task is being executed. We constructed a hybrid fault tolerant grid scheduler using GridSim 4.2 toolkit. We demonstrated that our proposed fault tolerant scheduler shows better results in terms of success rate in comparison with the existing fault tolerant scheduler.
Proceedings of the International Conference on Internet of things and Cloud Computing, 2016
In this paper, we propose a practical and efficient word and phrase proximity searchable encrypti... more In this paper, we propose a practical and efficient word and phrase proximity searchable encryption protocols for cloud based relational databases. The proposed advanced searchable encryption protocols are provably secure. We formalize the security assurance with cryptographic security definitions and prove the security of our searchable encryption protocols under Shannon's perfect secrecy assumption. We have tested the proposed protocols comprehensively on Amazon's high performance computing server using mysql database and presented the results. The proposed protocols ensure that there is zero overhead of space and communication because cipher text size being equal to plaintext size. For the same reason, the database schema also does not change for existing applications. In this paper, we also present results of comprehensive analysis for Song, Wagner, and Perrig scheme.
2015 Global Conference on Communication Technologies (GCCT), 2015
Computational grids have the potential for solving large - scale and scientific problems using ge... more Computational grids have the potential for solving large - scale and scientific problems using geographically distributed and heterogeneous resources. In addition to the challenges of managing and scheduling resources reliable challenges arise because the grid infrastructure is unreliable. There are two major problems in Scheduling the Grid 1) Efficient Scheduling of jobs 2) Providing fault tolerance in a reliable manner. Most of the existing strategies do not provide fault tolerance for scheduling the workflows. There are some algorithms which provide fault tolerance but, they do a significant measure of redundant computation to provide fault tolerance. This paper addresses this issue and reduces the redundant work by using a group level table of data. This technique is suitable for workflow of jobs.
2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2015
Authenticated mesh peering exchange (AMPE) is one of the core functionalities of wireless mesh ne... more Authenticated mesh peering exchange (AMPE) is one of the core functionalities of wireless mesh network(WMN) that facilitates mesh routers to discover their peers (neighbours), securely. Even though the AMPE protocol prevents unauthorized neighbours from becoming part of the network, it fails to prevent relay attacks, where an attacker can simply relay frames used to establish peer-links. The motivation of an attacker is to convince two far-away nodes as neighbours, and make them commit to a non-existent link that acts as a wormhole later. In this paper, we address this problem of relay attacks and propose a secure neighbour discovery mechanism that detects non-existent network links. It relies on a ranking mechanism to compute relative distance between neighbours, and employs connectivity information to validate those links.
2015 IEEE International Advance Computing Conference (IACC), 2015
Grid Computing pools the resources from various heterogeneous computers to solve a particular pro... more Grid Computing pools the resources from various heterogeneous computers to solve a particular problem which requires huge computation. In a grid, a number of known and unknown entities from same or different domain participate in communication where in every entity need to undergo a strong authentication and authorization scheme. There is risk while making the communication among untrusted entities since there is a chance of misusing resources. So, in-order to avoid this problem a strong trust establishment phenomenon is required. This paper demonstrates a randomized algorithm for developing a trust model which makes the user and service provider to maintain consistency among their ratings from each other every time, so that they reach the eligible criteria for communication.
To protect the resources from various vulnerability factors, resources should have various routin... more To protect the resources from various vulnerability factors, resources should have various routine security mechanisms such as antivirus capability, firewall capability, usage of secure network connections, provision of execution sandbox, invoking dynamic checkpointing, and intrusion detection system-related capabilities. Security is one of the key issues in distributed computing systems like grid and cloud. Whole system is secured when resources have self-defense capability. Adapting security measures in grid environment is an expensive mechanism and leads to delays in service provisioning whereas trust can be, relatively, a simple and fast solution. In view of the interest of the users and quick delivery of the services by the provider, integration of different combinations of trust levels and security mechanisms can reduce the costs and delays involved in adapting security measures. This paper proposes a new approach for integrating security levels along with trust in general for distributed computing systems and in particular for grid computing systems. Our previous work proposed a T-grid computational model suitable for grid computing systems, which will be used for experimenting and testing the proposed idea of the integration. Results of the studies are produced.
The paper focuses on the software system developed for the proposed architecture of the grid mean... more The paper focuses on the software system developed for the proposed architecture of the grid meant for Indian rural health care system. The application developed would display various activities and functionalities. The application will consolidate the Infant and women health data at various grid levels i.e. at the village, mandal, city and district. The application helps a rural doctor to get the advice by a specialist doctor in the city for preventive health care.
2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2018
With the widespread usage of Cloud Computing model in business, organizations prefer to outsource... more With the widespread usage of Cloud Computing model in business, organizations prefer to outsource their data to the cloud. In order to preserve confidentiality of data, the data is encrypted before being outsourced. In order to use this encrypted data in decision making, symmetric searchable encryption is employed that enables users to fetch data matching the keywords over encrypted data without decrypting the data. Many existing schemes search for a single keyword without an index, leading to search time linear to the size of data. And moreover, support for multiple keyword searches or phrase search is also a trending challenge in the field of searchable encryption. In this paper, we extend the practical techniques for searches on encrypted data proposed by Song, et.al, by improving the search efficiency with help of an encrypted and dynamic index. We use a very efficient structure to enable dynamic updates to the index in event of changes to the encrypted dataset. Our proposed scheme is the first one to use such a simple yet update-efficient structure for index. Multi-phrase search being implemented helps in obtaining most representative documents for searches, especially in mobile devices. We also implemented and analyzed efficiency of Song et al scheme, which is one of the pioneering works in field of searchable encryption. Security analysis and extensive experiments were conducted to test the security guarantees and efficiency of the proposed extensions.
With the characteristic of spatial diversity and low cost, cooperative system is a tendency for t... more With the characteristic of spatial diversity and low cost, cooperative system is a tendency for the future communications. In the wireless communication system, there exist degradation factors such as signal fading, multipath transmission, signal inferences, bandwidth limitation and so on. In addition to these degradation factors, the wireless transmission is not a secure environment. The information might be leaked during the transmission. Currently , the issues of privacy and security have become increasingly important for the mobile users. Traditionally, the security scheme is applied to the higher network layer. Encryption can be complex and difficult without infrastructure. It is not suitable to apply to the equipment with low computing resources, such as Internet of Things (IoT) application. Within information theoretic security characterizes the fundamental ability of the physical layer to provide a secure transmission. Hence, this work concentrates on the secure cooperative ...
This paper focusses on proposing a system for grid based health care center. The paper dicusses t... more This paper focusses on proposing a system for grid based health care center. The paper dicusses the importance of health care center and grid computing. It also focusses on the proposed sytem architecture for the system which has to be built. We will also discuss about the needed scheduling algorithm in this paper that will run in the system and help in data sharing process. The numerous user interface screens states the kind of system we are about to develop.
2017 International Conference on Inventive Systems and Control (ICISC), 2017
Outsourcing of sensitive and critical data into third party thus untrusted service environments r... more Outsourcing of sensitive and critical data into third party thus untrusted service environments remains a serious security concern. In such environments, data needs to be protected throughout its lifecycle i.e. at-rest, in-transit and while-in-use. Data in third phase remains mostly unprotected as it demands operations to be performed over encrypted data while achieving semantics same as in case of plaintext data. This is a big challenge and thus data remains vulnerable in third phase when hosted in above environments. In this paper, we propose a novel solution to this challenge. We present a scheme on proximity-based-search on encrypted data when a majority of research is limited to exact-keyword-search only. We propose a novel scheme for proximity-based-search on encrypted databases hosted in untrusted service environments. This scheme involves a trusted proxy which facilitates a trapdoor to execute search queries over encrypted data while achieving perfect secrecy as well. It implements an idea of transitive Referential Dissimilarity over byte distances for each corresponding pair of bytes in any two given words. This technique is based on Levenshtein Distance. To the best of our knowledge, such a scheme has been proposed for the first time and it presents a two-point novelty. Firstly, it supports basic OLTP operations securely and seamlessly as evident in presented performance statistics. Secondly, it remains provably secure and practical towards real world application requirements as it does not demand any modifications to existing ecosystems.
Scheduling of jobs is one of the crucial tasks in grid environment. We consider non-preemptive sc... more Scheduling of jobs is one of the crucial tasks in grid environment. We consider non-preemptive scheduling of independent tasks in a computational grid. Recently, a general distributed scalable grid scheduler (GDS) was proposed, which prioritizes mission-critical tasks while maximizing the number of tasks meeting deadlines. However, the GDS scheduler did not consider the reliability factor, which may result in low successful schedule rates. In this paper, we propose a novel distributed grid scheduler which takes reliability factor (RDGS) into consideration with respect to the failure of grid nodes. The proposed scheduler invokes the tasks allocated to deficient grid nodes and maintains them in a queue. Further the queued tasks are rescheduled to the other nodes of the grid. It is observed that RDGS scheduler shows a significant improvement in terms of successfully scheduled tasks as compared to a variation of GDS without priority and deadlines (GDS-PD). The results of our exhaustive ...
International Journal of Advanced Research in Computer Science, 2017
Grid computing technology is a technique to share various resources like memory, storage, process... more Grid computing technology is a technique to share various resources like memory, storage, processor that are idle, to solve very huge and complex problems. These resources are shared among various heterogeneous computers, which form a virtual organization. The computers involved in communication for sharing resources might be from the same domain or from different domains. The risk is more in communication among computers from different domains since they are unknown to each other and there are more chances to misuse the resources. To avoid the above mentioned problems, various trust models are prepared to assess the computers for their trustworthiness in communication. This paper proposes a trust model, which uses a regression model to predict the behavior of client and service provider for further communication in a more secure manner. This regression model is developed based on the data collected through a survey; also, a reliability test was conducted to check the consistency of...
The main motivation of an attacker is to convince two far away nodes as neighbor nodes using worm... more The main motivation of an attacker is to convince two far away nodes as neighbor nodes using wormhole attack easily without the knowledge of cryptographic primitives. Thus, it can significantly degrade the performance of Wireless Mesh Networks (WMNs). Secure neighbor discovery is a fundamental requirement of network nodes to ensure secure data communication. An adversary that bypass neighbor discovery process of a legitimate node using wormhole attack can disrupt the overlying protocols and applications. In this paper, we propose a secure neighbor verification mechanism to thwart wormhole attack that can prevent bogus links from being involved in the network operations. It employs node ranking scheme to compute relative distance between neighbors and uses connectivity information to check the genuinity of neighborhood creation. We evaluate our mechanism using simulation to demonstrate the efficiency in the presence of wormholes.
Proceedings of the International Congress on Information and Communication Technology, 2016
A computational grid is an environment for achieving better performance and throughput by pooling... more A computational grid is an environment for achieving better performance and throughput by pooling geographically distributed heterogeneous resources dynamically depending on their availability, capability, performance, and cost and user quality of self-service requirement. Fault tolerant grid scheduling is a significant concern for computational grid systems. The handling of failures can happen either before or after scheduling tasks on grid resources. Generally, there are two approaches used for the handling of failures namely, post-active fault-tolerant approach and pro-active fault tolerant approach. Recently, a fault tolerant scheduler for grids proposed uses pro-active approach in selecting resources by computing scheduling indicator. However, this study did not considered failure of node while the task is being executed. Thus in our study, we incorporates post-active fault tolerant approach to the exiting study, i.e., migrating of task to another node in the event of failure of node while the task is being executed. We constructed a hybrid fault tolerant grid scheduler using GridSim 4.2 toolkit. We demonstrated that our proposed fault tolerant scheduler shows better results in terms of success rate in comparison with the existing fault tolerant scheduler.
Proceedings of the International Conference on Internet of things and Cloud Computing, 2016
In this paper, we propose a practical and efficient word and phrase proximity searchable encrypti... more In this paper, we propose a practical and efficient word and phrase proximity searchable encryption protocols for cloud based relational databases. The proposed advanced searchable encryption protocols are provably secure. We formalize the security assurance with cryptographic security definitions and prove the security of our searchable encryption protocols under Shannon's perfect secrecy assumption. We have tested the proposed protocols comprehensively on Amazon's high performance computing server using mysql database and presented the results. The proposed protocols ensure that there is zero overhead of space and communication because cipher text size being equal to plaintext size. For the same reason, the database schema also does not change for existing applications. In this paper, we also present results of comprehensive analysis for Song, Wagner, and Perrig scheme.
2015 Global Conference on Communication Technologies (GCCT), 2015
Computational grids have the potential for solving large - scale and scientific problems using ge... more Computational grids have the potential for solving large - scale and scientific problems using geographically distributed and heterogeneous resources. In addition to the challenges of managing and scheduling resources reliable challenges arise because the grid infrastructure is unreliable. There are two major problems in Scheduling the Grid 1) Efficient Scheduling of jobs 2) Providing fault tolerance in a reliable manner. Most of the existing strategies do not provide fault tolerance for scheduling the workflows. There are some algorithms which provide fault tolerance but, they do a significant measure of redundant computation to provide fault tolerance. This paper addresses this issue and reduces the redundant work by using a group level table of data. This technique is suitable for workflow of jobs.
2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2015
Authenticated mesh peering exchange (AMPE) is one of the core functionalities of wireless mesh ne... more Authenticated mesh peering exchange (AMPE) is one of the core functionalities of wireless mesh network(WMN) that facilitates mesh routers to discover their peers (neighbours), securely. Even though the AMPE protocol prevents unauthorized neighbours from becoming part of the network, it fails to prevent relay attacks, where an attacker can simply relay frames used to establish peer-links. The motivation of an attacker is to convince two far-away nodes as neighbours, and make them commit to a non-existent link that acts as a wormhole later. In this paper, we address this problem of relay attacks and propose a secure neighbour discovery mechanism that detects non-existent network links. It relies on a ranking mechanism to compute relative distance between neighbours, and employs connectivity information to validate those links.
2015 IEEE International Advance Computing Conference (IACC), 2015
Grid Computing pools the resources from various heterogeneous computers to solve a particular pro... more Grid Computing pools the resources from various heterogeneous computers to solve a particular problem which requires huge computation. In a grid, a number of known and unknown entities from same or different domain participate in communication where in every entity need to undergo a strong authentication and authorization scheme. There is risk while making the communication among untrusted entities since there is a chance of misusing resources. So, in-order to avoid this problem a strong trust establishment phenomenon is required. This paper demonstrates a randomized algorithm for developing a trust model which makes the user and service provider to maintain consistency among their ratings from each other every time, so that they reach the eligible criteria for communication.
Uploads
Papers by Prof. S. Ramachandram