Mayank Verma - Profile on Academia.edu (original) (raw)

Papers by Mayank Verma

In this work, we attempt an NP-hard problem called multi item, multi period two level capacitated... more In this work, we attempt an NP-hard problem called multi item, multi period two level capacitated lot sizing problem with considerations of backorders and setup times. To be close to reality, the demand is considered to be dynamic. With the use of Lagrangian relaxation, the problem is reduced to a continuous knapsack problem which is then solved using bounded variable linear programs. Though the problem is solved close to optimality, the solution is further improved by the use of a branch and bound method in order to obtain a solution closer to optimal. As the procedure makes use of the most basic algebraic computations, it is competent to confront the best available commercial solvers in terms of computational times for large sized problems. The procedure is robust enough to be applicable to a variety of real life problems with a similar formulation structure.

In this work we introduce an innovative procedure to solve the capacitated lot sizing problem wit... more In this work we introduce an innovative procedure to solve the capacitated lot sizing problem with backorders and setup times, called CLSP_BS. The procedure formulates CLSP_BS as a mixed integer programming (MIP) problem, reduces it to the structure of a bounded variable linear program; and then calculates some ratios of the coefficients to determine an approximate solution to the problem. This initial solution is further improved using an intelligent enumeration procedure. Adopting this procedure, we solve the NP hard MIP differently and easily, by mere calculation of a few ratios and without actually using any traditional solution approaches, viz. simplex, interior point method, etc.

We investigate different formulations of the multi item, multi period capacitated lot sizing prob... more We investigate different formulations of the multi item, multi period capacitated lot sizing problem with inclusions of backorders, setup times and setup costs into it. The problem is closer to the realistic situations and is abbreviated as CLSP_BS in this work. Apart from the classical formulation, we give two variants of the transportation formulation of CLSP_BS. Objective values of these three formulations are exactly equivalent to each other, but they rank different in terms of computational times. When we compare the bounds obtained by LP relaxation of the classical and the two transportation formulations, it is observed that classical and one of the two transportation formulations are exactly equivalent; however the other transportation formulation generates a comparatively better bound. Based on this information on strength of bounds, we earmark the formulations of CLSP_BS as strong and weak. This knowledge about strong and weak formulations can prove to be fruitful while solving real life large sized problems. Limited computational experiences are shown here which establish the stated claims.

Privacy preservation services: challenges and solutions

The current Internet architecture was designed at a time when many of the current network applica... more The current Internet architecture was designed at a time when many of the current network applications did not even exist. As a result, it has become increasingly difficult to de-ploy new and secure services on the Internet. Hence, a new Internet architecture is required to address the ...

SEAS: A Secure and Efficient Anonymity Scheme for Low-Cost RFID Tags

In this paper, we propose SEAS, a novel privacy preserving, anonymous authentication scheme for R... more In this paper, we propose SEAS, a novel privacy preserving, anonymous authentication scheme for RFID tags, which allows the tags to use pseudonyms instead of their true identity for authentication. Using SEAS, a tag generates random numbers and uses them to create a pseudonym as its identity for authentication. The pseudonym does not reveal the identity of the tag and the pseudonyms of multiple authentications appear random and uncorrelated to the adversary. A pseudonym can only be deciphered by the back-end authentication authority to identify the tag. No other entity in the network can link the pseudonym to the identity of the tag. Our scheme is efficient, with a tag needing to perform only simple operations such as XOR, bits shifting, bits concatenation, and random number generation. We perform security analysis of our scheme to show its effectiveness against different forms of attacks. We also perform comparison of our scheme with existing schemes in terms of efficiency in the use of resources. Our scheme performs effectively, while at the same time being better than the other popular schemes in the literature in terms of cost and computation efficiency.

ASPE: attribute-based secure policy enforcement in vehicular ad hoc networks

Ad Hoc Networks, 2009

Vehicular ad hoc networks (VANETs) are usually operated among vehicles moving at high speeds, and... more Vehicular ad hoc networks (VANETs) are usually operated among vehicles moving at high speeds, and thus their communication relations can be changed frequently. In such a highly dynamic environment, establishing trust among vehicles is difficult. To solve this problem, ...

A Distributed ePedigree Architecture

Current ePedigree creation and discovery services rely on a centralized framework, i.e., EPCgloba... more Current ePedigree creation and discovery services rely on a centralized framework, i.e., EPCglobal network. The centralized system has several restrictions to prevent it from being widely adopted. For example, it is unscalable when ePedigree service requests are increased dramatically due to the item-level product tracking; it has little privacy protection since the product historical information can be easily derived from the object name service (ONS) provided by the centralized EPCglobal network; it is cumbersome since the ePedigree information will be amplified in the local databases along with the product transportation stops; and so on. To overcome the above mentioned problems, we propose a distributed EPC information service (EPC-IS), which makes the ePedigree creation and discovery more robust, scaleable, and secure. Using our approach, the ePedigree historical records of a product is created and stored in the ePedigree creating parties' EPC-IS servers; in addition, each EPC-IS server maintains a look up table that stores the EPC-IS providers' one-hop up/down stream information. In this way, the ePedigree service creation and discovery are processed following a chain of processes with a distributed manner. The distributed ePedigree architecture and a set of EPC-IS service protocols are described in this paper

IEEE Transactions on Intelligent Transportation Systems, 2011

In this paper, we propose a new privacy preservation scheme, named pseudonymous authentication-ba... more In this paper, we propose a new privacy preservation scheme, named pseudonymous authentication-based conditional privacy (PACP), which allows vehicles in a vehicular ad hoc network (VANET) to use pseudonyms instead of their true identity to obtain provably good privacy. In our scheme, vehicles interact with roadside units to help them generate pseudonyms for anonymous communication. In our setup, the pseudonyms are only known to the vehicles but have no other entities in the network. In addition, our scheme provides an efficient revocation mechanism that allows vehicles to be identified and revoked from the network if needed. Thus, we provide conditional privacy to the vehicles in the system, that is, the vehicles will be anonymous in the network until they are revoked, at which point, they cease to be anonymous.

In this paper, we propose a novel scheme to achieve secure, and efficient vehicular communication... more In this paper, we propose a novel scheme to achieve secure, and efficient vehicular communication. In particular, SegCom provides two mechanisms to perform successive authentication of the vehicle with the road-side infrastructure units to expedite authentication for Vehicle-to-Infrastructure (V2I) communication. Furthermore, to enhance the efficiency of Vehicle-to-Vehicle (V2V) communication, SeGCom permits the vehicles to form group, which are also used for performing multi-hop V2V communication without any assistance from a trusted authority. Comparison with other existing schemes in the literature has been performed to show the efficiency and applicability of our scheme.

In this work, we attempt an NP-hard problem called multi item, multi period two level capacitated... more In this work, we attempt an NP-hard problem called multi item, multi period two level capacitated lot sizing problem with considerations of backorders and setup times. To be close to reality, the demand is considered to be dynamic. With the use of Lagrangian relaxation, the problem is reduced to a continuous knapsack problem which is then solved using bounded variable linear programs. Though the problem is solved close to optimality, the solution is further improved by the use of a branch and bound method in order to obtain a solution closer to optimal. As the procedure makes use of the most basic algebraic computations, it is competent to confront the best available commercial solvers in terms of computational times for large sized problems. The procedure is robust enough to be applicable to a variety of real life problems with a similar formulation structure.

In this work we introduce an innovative procedure to solve the capacitated lot sizing problem wit... more In this work we introduce an innovative procedure to solve the capacitated lot sizing problem with backorders and setup times, called CLSP_BS. The procedure formulates CLSP_BS as a mixed integer programming (MIP) problem, reduces it to the structure of a bounded variable linear program; and then calculates some ratios of the coefficients to determine an approximate solution to the problem. This initial solution is further improved using an intelligent enumeration procedure. Adopting this procedure, we solve the NP hard MIP differently and easily, by mere calculation of a few ratios and without actually using any traditional solution approaches, viz. simplex, interior point method, etc.

We investigate different formulations of the multi item, multi period capacitated lot sizing prob... more We investigate different formulations of the multi item, multi period capacitated lot sizing problem with inclusions of backorders, setup times and setup costs into it. The problem is closer to the realistic situations and is abbreviated as CLSP_BS in this work. Apart from the classical formulation, we give two variants of the transportation formulation of CLSP_BS. Objective values of these three formulations are exactly equivalent to each other, but they rank different in terms of computational times. When we compare the bounds obtained by LP relaxation of the classical and the two transportation formulations, it is observed that classical and one of the two transportation formulations are exactly equivalent; however the other transportation formulation generates a comparatively better bound. Based on this information on strength of bounds, we earmark the formulations of CLSP_BS as strong and weak. This knowledge about strong and weak formulations can prove to be fruitful while solving real life large sized problems. Limited computational experiences are shown here which establish the stated claims.

Privacy preservation services: challenges and solutions

The current Internet architecture was designed at a time when many of the current network applica... more The current Internet architecture was designed at a time when many of the current network applications did not even exist. As a result, it has become increasingly difficult to de-ploy new and secure services on the Internet. Hence, a new Internet architecture is required to address the ...

SEAS: A Secure and Efficient Anonymity Scheme for Low-Cost RFID Tags

In this paper, we propose SEAS, a novel privacy preserving, anonymous authentication scheme for R... more In this paper, we propose SEAS, a novel privacy preserving, anonymous authentication scheme for RFID tags, which allows the tags to use pseudonyms instead of their true identity for authentication. Using SEAS, a tag generates random numbers and uses them to create a pseudonym as its identity for authentication. The pseudonym does not reveal the identity of the tag and the pseudonyms of multiple authentications appear random and uncorrelated to the adversary. A pseudonym can only be deciphered by the back-end authentication authority to identify the tag. No other entity in the network can link the pseudonym to the identity of the tag. Our scheme is efficient, with a tag needing to perform only simple operations such as XOR, bits shifting, bits concatenation, and random number generation. We perform security analysis of our scheme to show its effectiveness against different forms of attacks. We also perform comparison of our scheme with existing schemes in terms of efficiency in the use of resources. Our scheme performs effectively, while at the same time being better than the other popular schemes in the literature in terms of cost and computation efficiency.

ASPE: attribute-based secure policy enforcement in vehicular ad hoc networks

Ad Hoc Networks, 2009

Vehicular ad hoc networks (VANETs) are usually operated among vehicles moving at high speeds, and... more Vehicular ad hoc networks (VANETs) are usually operated among vehicles moving at high speeds, and thus their communication relations can be changed frequently. In such a highly dynamic environment, establishing trust among vehicles is difficult. To solve this problem, ...

A Distributed ePedigree Architecture

Current ePedigree creation and discovery services rely on a centralized framework, i.e., EPCgloba... more Current ePedigree creation and discovery services rely on a centralized framework, i.e., EPCglobal network. The centralized system has several restrictions to prevent it from being widely adopted. For example, it is unscalable when ePedigree service requests are increased dramatically due to the item-level product tracking; it has little privacy protection since the product historical information can be easily derived from the object name service (ONS) provided by the centralized EPCglobal network; it is cumbersome since the ePedigree information will be amplified in the local databases along with the product transportation stops; and so on. To overcome the above mentioned problems, we propose a distributed EPC information service (EPC-IS), which makes the ePedigree creation and discovery more robust, scaleable, and secure. Using our approach, the ePedigree historical records of a product is created and stored in the ePedigree creating parties' EPC-IS servers; in addition, each EPC-IS server maintains a look up table that stores the EPC-IS providers' one-hop up/down stream information. In this way, the ePedigree service creation and discovery are processed following a chain of processes with a distributed manner. The distributed ePedigree architecture and a set of EPC-IS service protocols are described in this paper

IEEE Transactions on Intelligent Transportation Systems, 2011

In this paper, we propose a new privacy preservation scheme, named pseudonymous authentication-ba... more In this paper, we propose a new privacy preservation scheme, named pseudonymous authentication-based conditional privacy (PACP), which allows vehicles in a vehicular ad hoc network (VANET) to use pseudonyms instead of their true identity to obtain provably good privacy. In our scheme, vehicles interact with roadside units to help them generate pseudonyms for anonymous communication. In our setup, the pseudonyms are only known to the vehicles but have no other entities in the network. In addition, our scheme provides an efficient revocation mechanism that allows vehicles to be identified and revoked from the network if needed. Thus, we provide conditional privacy to the vehicles in the system, that is, the vehicles will be anonymous in the network until they are revoked, at which point, they cease to be anonymous.

In this paper, we propose a novel scheme to achieve secure, and efficient vehicular communication... more In this paper, we propose a novel scheme to achieve secure, and efficient vehicular communication. In particular, SegCom provides two mechanisms to perform successive authentication of the vehicle with the road-side infrastructure units to expedite authentication for Vehicle-to-Infrastructure (V2I) communication. Furthermore, to enhance the efficiency of Vehicle-to-Vehicle (V2V) communication, SeGCom permits the vehicles to form group, which are also used for performing multi-hop V2V communication without any assistance from a trusted authority. Comparison with other existing schemes in the literature has been performed to show the efficiency and applicability of our scheme.