Durgesh Kumar Mishra

Security issues in MANET: A review

Sometimes the physically distributed computing devices in a network may be interested in computing some function of their private inputs without disclosing these inputs to one another. This type of computation falls under the category of Secure Multiparty Computation (SMC). The solution to SMC problems in Mobile Ad hoc Networks (MANET) can be found with the modification of the data inputs or with some anonymization technique. MANETs are the wireless networks of the mobile computing devices with no support of any fixed infrastructure. The mobile nodes use any of the radio technology like Bluetooth, IEEE 802.11 or Hiperlan for directly communicating with each other. The nodes behave as hosts as well as routers. The security challenges in the MANET arise due to its dynamic topology, vulnerable wireless link and nomadic environment. An identification mechanism is needed between the nodes using identification and the credentials. This security architecture simultaneously leads to privacy problems. Some mechanism is needed which prevents a node to learn the identity or the credentials of other nodes. To provide location privacy in MANET is a nontrivial task. Current routing protocols do not focus much on the security and the privacy issues. These aspects are postponed till further development. An authentication protocol is needed between nodes using some cryptographic technique. In service-oriented MANET the denial of the service must be taken care of so that the availability of the service is maintained. The security requirement of the ad hoc network depends on its application. For example, for a simple business meeting the requirement is mitigated and for the military battlefield it is severe. Thus no general security architecture can be developed for MANET. Specific security architecture is needed for specific application. Much security related work is still pending and will add to the standards as the physical deployment of the MANET will grow. In this paper, an emphasis is made on how SMC solutions can be used for privacy preservation during computation.

A zero-hacking protocol for secure multiparty computation using multiple TTP

We present a solution to the Secure Multi-party Computation (SMC) problem in the form of a protocol that ensures zero-hacking. The solution comprises of a protocol with several trusted third parties (TTPs) where there is a possibility of threat to the security. Our protocol unanimously selects one TTP among all TTPs in the SMC architecture that owns the responsibility of all the computation in the system. This TTP is called the master TTP and it is different at different times. The procedure of selecting master TTP could be non-deterministic but it is made deterministic by randomization technique. This ensures that no single TTP controls the entire system all the times. At the same time, this also ensures that no TTP knows where the computation is taking place. This approach is having merit over the other one where only one TTP is given the responsibility to hold entire data of the system. Hence, the chances of corruption can be reduce to negligible when we randomize the selection of one TTP instead of having unknown TTP. Our algorithm works on the concepts of multiple TTP to provide zero-hacking for the entire system owing to the situation that it becomes almost impossible for any party to break the security. Formally it is achieved by imposing high computational complexity on the parties.

Cloud computing: Survey of different utilization techniques

The Cloud computing which performs the task of the computing and storage capacity for a service to provide the flexibility for users. The providers manage the infrastructure and platforms on which the applications run by user. It relies on the sharing of resources to achieve the coherency and scalability for the utilization. Cloud computing relies on the network as an elementary service. The aim of this paper is for the survey of the several utilization techniques and some security aspects which are used in cloud computing.

Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach “Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)” which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstras algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.

Secure Multiparty Computation: From Millionaires Problem to Anonymizer

ABSTRACT In Secure Multiparty Computation (SMC), multiple parties perform joint computation over their private data inputs preserving the privacy of their individual inputs. This type of computation needs to provide correct result while keeping the individual input a secret. In todays scenario of tremendous growth of the Internet and large volumes of online transactions, the concept of data privacy and SMC has become a matter of great concern. People frequently need to perform joint computations for the sake of their mutual benefits, but they are also worried about confidentiality of their private data. This situation arises due to lack of trust among computing parties. For example, two banks may want to find some details of a customer but each of the banks may want to keep their sensitive database a secret or they may not want to disclose the customers identity. The subject of SMC has evolved from earlier solutions of combinational logic circuits to the recent proposals of anonymity-enabled computation. In this paper, we put together the significant research that has been carried out. We propose new possibilities of problem discovery and its analysis. We put critical issues and challenges and the level of adaptation achieved before the researchers. We also provide some research proposals based on the literature survey.

Arithmetic cryptography protocol for secure multi-party computation

In this paper, we propose a cryptographic solution for secure multi-party computation (SMC). SMC is also called secure function evaluation, which is extensively studied in classical cryptography. SMC protocol allows n participants p1...pn to compute an n-input data through trusted third party (TTP) without revealing the information of the parties. All the parties may perform secure communication with TTP for computation. During the computation, TTP may undesirably extract data of all the parties for misuse. It may be risky if the data is sent out.

Electronic Data Interchange: A Review

EDI encourages long-term commitment with trading partners, makes the transmission of information more efficient, and allows firms to be more responsive to customer needs through shorter order cycles. The electronic data interchange technology allows to do the simultaneously reducing costs by reducing paper, mail expense, and delays due to data entry errors This paper presenting here the business issues and describes existing and potential solutions and it is a transmission in a standard syntax of unambiguous information of business or strategic significance between computers of independent organization. This paper also representing the AS2 specification, implementation and EDI data transmitted over the Internet.

4G Revolution: WiMAX technology

The 4G Revolution has begun with many of the advantages in wireless technology. The IEEE802.16 standard worldwide interoperability for microwave access is a technique which is used basically for the wireless and broadband for allowing high speed internet access for long distances. This new technique has made everything an mobile activity whether it is used as in business purpose or any other kind of task. The higher capacity and reliability of WiMAX make it useful in an efficient way. Security is the major challenge in wireless technology as because in wireless system its very easy to tune with the radio signals. Security concerns in WiMAX with fixed and mobile stations. In fixed location WiMAX for internet access a fixed location radio technology is used rather than cable modem or DSL services. In mobile WiMAX a fixed location wireless access is provided to cable modem and DSL services. The comparative study between the fixed and mobile WiMAX in this research make some important issued to understand about this. The various generations of mobile technology are mentioned here to demonstrate the differences and the advantages of this new revolution. The very advance techniques of LTE and WiMAX are differentiated on various characteristics. And the security issues are there to resolve many of the problems that can harm to the wireless communication.

Critical Node Detection in Large Scale Mobile Ad hoc Networks

calculation of large scale MANETs is an NP computational problem, and this complexity can be reduced by identifying critical nodes in a network. The identification of critical nodes itself is a computationally hard problem. The present work provides an empirical Algorithm for detecting critical nodes in a MANET which is computationally efficient than the already existing detection methods. The algorithm proposed for critical node detection is based on the pattern a critical node may exhibit uniquely in a connection matrix.

Extended Taxonomy of Rule Extraction Techniques and Assessment of KDRuleEx

Classifiers like ANN & SVM are always preferred over other classification model like decision tree due to higher accuracy but lacking explainability and comprehensibility. Rule extraction techniques bridges gap between accuracy and comprehensibility. To evaluate and compare different rule extraction techniques, we require measures for evaluation and categorization. Taxonomy helps us to select a technique based on the requirements and desired priorities. In this paper, we extended popular ADT-taxonomy of rule extraction which has been designed for ANN as underlying model. Proposed taxonomy covers all types of work related to rule extraction. It makes easier to introduce new rule extraction techniques by improving the performance on evaluation criteria. In this paper almost all possible aspects of evaluation and categorization of rule extraction techniques has been considered and further used to evaluate the algorithm KDRuleEx.