Jaideep Vaidya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jaideep Vaidya has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Vijayalakshmi Atluri
Rutgers University, USA
10 shared publications - Haibing Lu
Leavey School of Business, Santa Clara University, Santa Clara, California, USA
4 shared publications - Haibing Lu
Leavey School of Business, Santa Clara University, Santa Clara, CA 95053, USA
4 shared publications - Emre Uzun
Rutgers University
3 shared publications - Shamik Sural
Indian Institute of Technology
3 shared publications - David Lorenzi
Rutgers Business School
2 shared publications
Latest Publications
- 1 January 2018
- Published by IGI Global Scientific Publishing
- p. 130-164
Citizen-to-Citizen Resource Sharing in Emergency Response
During large-scale manmade or natural disasters, such as Superstorm Sandy and Hurricanes Harvey and Irma, collaborations among government agencies, NGOs, and businesses need to be coordinated to provide necessary resources to respond to emergency events. However, resources from citizens themselves are underutilized, such as their equipment or expertise. The citizen participation via social media enhanced the situational awareness, but the response management is still mainly handled by the government or government-sanctioned partners. By harnessing the power of citizen crowdsourcing, government agencies can create enhanced disaster situation awareness and facilitate effective utilization of resources provided by citizen volunteers, resulting in more effective disaster responses. This chapter presents a public engagement in emergency response (PEER) framework that provides an online and mobile crowdsourcing platform for incident reporting and citizens' resource volunteering as well as an intelligent recommender system to match-make citizen resources with emergency tasks.
- 1 January 2018
- Published by IGI Global Scientific Publishing
- p. 130-164
Citizen-to-Citizen Resource Sharing in Emergency Response
During large-scale manmade or natural disasters, such as Superstorm Sandy and Hurricanes Harvey and Irma, collaborations among government agencies, NGOs, and businesses need to be coordinated to provide necessary resources to respond to emergency events. However, resources from citizens themselves are underutilized, such as their equipment or expertise. The citizen participation via social media enhanced the situational awareness, but the response management is still mainly handled by the government or government-sanctioned partners. By harnessing the power of citizen crowdsourcing, government agencies can create enhanced disaster situation awareness and facilitate effective utilization of resources provided by citizen volunteers, resulting in more effective disaster responses. This chapter presents a public engagement in emergency response (PEER) framework that provides an online and mobile crowdsourcing platform for incident reporting and citizens' resource volunteering as well as an intelligent recommender system to match-make citizen resources with emergency tasks.
- Open Access
- 9 May 2015
- Published by Springer Nature
- p. 354-368
Enhancing the Security of Image CAPTCHAs Through Noise Addition
- 9 May 2015
- Published by Springer Nature
- p. 354-368
Open AccessEnhancing the Security of Image CAPTCHAs Through Noise Addition
- 1 February 2015
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 27 (1) , 20-34
Statistical Database Auditing Without Query Denial Threat
Statistical database auditing is the process of checking aggregate queries that are submitted in a continuous manner, to prevent inference disclosure. Compared to other data protection mechanisms, auditing has the features of flexibility and maximum information. Auditing is typically accomplished by examining responses to past queries to determine whether a new query can be answered. It has been recognized that query denials release information and can cause data disclosure. This paper proposes an auditing mechanism that is free of query denial threat and applicable to mixed types of aggregate queries, including sum, max, min, deviation, etc. The core ideas are (i) deriving the complete information leakage from each query denial and (ii) carrying the complete leaked information derived from past answered and denied queries to audit each new query. The information leakage deriving problem can be formulated as a set of parametric optimization programs, and the whole auditing process can be modeled as a series of convex optimization problems.
- 1 February 2015
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 27 (1) , 20-34
Statistical Database Auditing Without Query Denial Threat
Statistical database auditing is the process of checking aggregate queries that are submitted in a continuous manner, to prevent inference disclosure. Compared to other data protection mechanisms, auditing has the features of flexibility and maximum information. Auditing is typically accomplished by examining responses to past queries to determine whether a new query can be answered. It has been recognized that query denials release information and can cause data disclosure. This paper proposes an auditing mechanism that is free of query denial threat and applicable to mixed types of aggregate queries, including sum, max, min, deviation, etc. The core ideas are (i) deriving the complete information leakage from each query denial and (ii) carrying the complete leaked information derived from past answered and denied queries to audit each new query. The information leakage deriving problem can be formulated as a set of parametric optimization programs, and the whole auditing process can be modeled as a series of convex optimization problems.
- 24 January 2014
- Published by SAGE Publications in Journal of Computer Security
- Vol. 22 (1) , 1-31
An optimization framework for role mining
Role Based Access Control (RBAC) is accepted as the de facto access control model for organizations of all sizes. However, engineering the right set of roles is crucial to enable the correct deployment of RBAC within an organization. Indeed, discovering an optimal and correct set of roles from existing permission assignments, referred to as the role mining problem (RMP), has gained significant attention in recent years. Role Mining is itself an instantiation of Boolean matrix decomposition – wherein a Boolean matrix is decomposed into two Boolean matrices giving a set of basis vectors and their appropriate combination. In fact, such decompositions are useful in a number of application domains beyond role engineering, including text mining as well as knowledge discovery. While a Boolean matrix can be decomposed in many ways, however, certain decompositions better characterize the semantics associated with the original matrix in a succinct but comprehensive way. Indeed, one can find different decompositions that are optimal with respect to different criteria that may match various semantics. In this paper, we first present a number of variants of the optimal Boolean matrix decomposition problem, including usage RMP, basic RMP, δ-approximate RMP, and edge RMP, that have pragmatic implications in the context of role mining. We then present a unified framework for modeling the optimal Boolean matrix decomposition and its variants using integer linear programming (ILP). Such modeling allows us to directly adopt the huge body of heuristic solutions and tools developed for integer linear programming. We also develop efficient heuristics and solutions for each RMP variant, and validate them by a comprehensive experimental evaluation.
- 24 January 2014
- Published by SAGE Publications in Journal of Computer Security
- Vol. 22 (1) , 1-31
An optimization framework for role mining
Role Based Access Control (RBAC) is accepted as the de facto access control model for organizations of all sizes. However, engineering the right set of roles is crucial to enable the correct deployment of RBAC within an organization. Indeed, discovering an optimal and correct set of roles from existing permission assignments, referred to as the role mining problem (RMP), has gained significant attention in recent years. Role Mining is itself an instantiation of Boolean matrix decomposition – wherein a Boolean matrix is decomposed into two Boolean matrices giving a set of basis vectors and their appropriate combination. In fact, such decompositions are useful in a number of application domains beyond role engineering, including text mining as well as knowledge discovery. While a Boolean matrix can be decomposed in many ways, however, certain decompositions better characterize the semantics associated with the original matrix in a succinct but comprehensive way. Indeed, one can find different decompositions that are optimal with respect to different criteria that may match various semantics. In this paper, we first present a number of variants of the optimal Boolean matrix decomposition problem, including usage RMP, basic RMP, δ-approximate RMP, and edge RMP, that have pragmatic implications in the context of role mining. We then present a unified framework for modeling the optimal Boolean matrix decomposition and its variants using integer linear programming (ILP). Such modeling allows us to directly adopt the huge body of heuristic solutions and tools developed for integer linear programming. We also develop efficient heuristics and solutions for each RMP variant, and validate them by a comprehensive experimental evaluation.
- 1 November 2013
- Published by Elsevier in Computers & Security
- Vol. 39, 201-218
AMTRAC: An administrative model for temporal role-based access control
- 1 November 2013
- Published by Elsevier in Computers & Security
- Vol. 39, 201-218
AMTRAC: An administrative model for temporal role-based access control
- 12 November 2012
- Published by SAGE Publications in Journal of Computer Security
- Vol. 20 (5) , 583-634
Secure and efficient distributed linear programming
In today's networked world, resource providers and consumers are distributed globally and locally, especially under current cloud computing environment. However, with resource constraints, optimization is necessary to ensure the best possible usage o
- 12 November 2012
- Published by SAGE Publications in Journal of Computer Security
- Vol. 20 (5) , 583-634
Secure and efficient distributed linear programming
In today's networked world, resource providers and consumers are distributed globally and locally, especially under current cloud computing environment. However, with resource constraints, optimization is necessary to ensure the best possible usage o
- Open Access
- 1 January 2012
- Published by European Alliance for Innovation n.o.
Secure Composition of Cascaded Web Services
A business process can be developed as a composition of Web services provided by different service providers. These service providers may have their own policies and constraints for service provisioning and collaboration. In this paper, we focus on secure composition of services, specifically from the perspective of service enactment. Service enactment requires finding an execution plan for the service composition that conforms to the requirements and constraints of the service requester and all service providers. However, due to privacy and security concerns, participants may selectively expose their Web service operations and process details. We propose an approach for service enactment that does not require the participants to reveal their internal operations and constraints and that can still result in an execution plan which satisfies the requirements and constraints of all participants. The proposed approach uses Finite State Machines (FSM) to model component Web service operations, their interdependencies, as well security and access control policy constraints. Model checking is used to generate an appropriate Web service execution plan in an incremental manner. Commutative encryption based techniques are used to preserve privacy and security.
- 1 January 2012
- Published by European Alliance for Innovation n.o.
Open AccessSecure Composition of Cascaded Web Services
A business process can be developed as a composition of Web services provided by different service providers. These service providers may have their own policies and constraints for service provisioning and collaboration. In this paper, we focus on secure composition of services, specifically from the perspective of service enactment. Service enactment requires finding an execution plan for the service composition that conforms to the requirements and constraints of the service requester and all service providers. However, due to privacy and security concerns, participants may selectively expose their Web service operations and process details. We propose an approach for service enactment that does not require the participants to reveal their internal operations and constraints and that can still result in an execution plan which satisfies the requirements and constraints of all participants. The proposed approach uses Finite State Machines (FSM) to model component Web service operations, their interdependencies, as well security and access control policy constraints. Model checking is used to generate an appropriate Web service execution plan in an incremental manner. Commutative encryption based techniques are used to preserve privacy and security.
- 4 November 2011
- Published by SAGE Publications in Journal of Computer Security
- Vol. 19 (5) , 795-833
A profile anonymization model for location-based services
Location-based services (LBS) aim at delivering point of need information. Personalization and customization of such services, based on the profiles of mobile users, would significantly increase the value of such services. Since profiles may include sensitive information of mobile users and moreover can help identify a person, such customization is allowable only when the security and privacy policies dictated by them are respected. While LBS providers are presumed to be untrusted entities, the location services that capture and maintain mobile users' location to enable communication are considered trusted, and therefore can capture and manage the profile information. The question then is, how to enable the use of location based services while protecting privacy? In this paper, we address the problem of privacy preservation via anonymization. Prior research in this area attempts to ensure k-anonymity by generalizing the location. However, a person may still be identified based on his/her profile if the profiles of all k people in the generalized region are not the same. We extend the notion of k-anonymity by proposing a profile based k-anonymization model that guarantees anonymity even when profiles of mobile users are revealed to untrusted entities. Specifically, our anonymization methods generalize both location and profiles to the extent specified by the user. We propose a novel unified index structure, called the PTPR-tree to enhance the performance during anonymization. PTPR-tree is an extension of the TPR-tree [in: SIGMOD'00: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, ACM, 2000, pp. 331–342] which organizes both the locations of mobile users as well as their profiles using a single index, and therefore can efficiently find candidate users for the proposed profile based anonymization models.
- 4 November 2011
- Published by SAGE Publications in Journal of Computer Security
- Vol. 19 (5) , 795-833
A profile anonymization model for location-based services
Location-based services (LBS) aim at delivering point of need information. Personalization and customization of such services, based on the profiles of mobile users, would significantly increase the value of such services. Since profiles may include sensitive information of mobile users and moreover can help identify a person, such customization is allowable only when the security and privacy policies dictated by them are respected. While LBS providers are presumed to be untrusted entities, the location services that capture and maintain mobile users' location to enable communication are considered trusted, and therefore can capture and manage the profile information. The question then is, how to enable the use of location based services while protecting privacy? In this paper, we address the problem of privacy preservation via anonymization. Prior research in this area attempts to ensure k-anonymity by generalizing the location. However, a person may still be identified based on his/her profile if the profiles of all k people in the generalized region are not the same. We extend the notion of k-anonymity by proposing a profile based k-anonymization model that guarantees anonymity even when profiles of mobile users are revealed to untrusted entities. Specifically, our anonymization methods generalize both location and profiles to the extent specified by the user. We propose a novel unified index structure, called the PTPR-tree to enhance the performance during anonymization. PTPR-tree is an extension of the TPR-tree [in: SIGMOD'00: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, ACM, 2000, pp. 331–342] which organizes both the locations of mobile users as well as their profiles using a single index, and therefore can efficiently find candidate users for the proposed profile based anonymization models.
- Open Access
Differentially Private Search Log Sanitization with Optimal Output Utility
Web search logs contain extremely sensitive data, as evidenced by the recent AOL incident. However, storing and analyzing search logs can be very useful for many purposes (i.e. investigating human behavior). Thus, an important research question is how to privately sanitize search logs. Several search log anonymization techniques have been proposed with concrete privacy models. However, in all of these solutions, the output utility of the techniques is only evaluated rather than being maximized in any fashion. Indeed, for effective search log anonymization, it is desirable to derive the optimal (maximum utility) output while meeting the privacy standard. In this paper, we propose utility-maximizing sanitization based on the rigorous privacy standard of differential privacy, in the context of search logs. Specifically, we utilize optimization models to maximize the output utility of the sanitization for different applications, while ensuring that the production process satisfies differential privacy. An added benefit is that our novel randomization strategy ensures that the schema of the output is identical to that of the input. A comprehensive evaluation on real search logs validates the approach and demonstrates its robustness and scalability.
Open AccessDifferentially Private Search Log Sanitization with Optimal Output Utility
Web search logs contain extremely sensitive data, as evidenced by the recent AOL incident. However, storing and analyzing search logs can be very useful for many purposes (i.e. investigating human behavior). Thus, an important research question is how to privately sanitize search logs. Several search log anonymization techniques have been proposed with concrete privacy models. However, in all of these solutions, the output utility of the techniques is only evaluated rather than being maximized in any fashion. Indeed, for effective search log anonymization, it is desirable to derive the optimal (maximum utility) output while meeting the privacy standard. In this paper, we propose utility-maximizing sanitization based on the rigorous privacy standard of differential privacy, in the context of search logs. Specifically, we utilize optimization models to maximize the output utility of the sanitization for different applications, while ensuring that the production process satisfies differential privacy. An added benefit is that our novel randomization strategy ensures that the schema of the output is identical to that of the input. A comprehensive evaluation on real search logs validates the approach and demonstrates its robustness and scalability.