Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Avinash Vyas

dblp:28/4866 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3Software engineering, systems software and programming languages · 2Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Computer networks
1 paper
Wireless sensing and localization · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
anonymization
0.112010
Policy-aware sender anonymity in location based services · ICDE 2010
Privacy and data protection
location privacy
0.112010
Policy-aware sender anonymity in location based services · ICDE 2010
Program verification
invariant verification
0.112005
Verification of Tree Updates for Optimization · CAV 2005
Wireless sensing and localization
location-based services
0.012010
Policy-aware sender anonymity in location based services · ICDE 2010

Methods — techniques the papers use, named apart from their topics

polynomial algorithm · 0.2anonymization policy optimization · 0.2
YearPublicationVenuePosition
2010 Policy-aware sender anonymity in location based services
abstract
Sender anonymity in location-based services (LBS) attempts to hide the identity of a mobile device user who sends requests to the LBS provider for services in her proximity (e.g. ¿find the nearest gas station¿ etc.). The goal is to keep the requester's interests private even from attackers who (via hacking or subpoenas) gain access to the request and to the locations of the mobile user and other nearby users at the time of the request. In an LBS context, the best-studied privacy guarantee is known as sender k-anonymity. We show that state-of-the art solutions for sender k-anonymity defend only against naive attackers who have no knowledge of the anonymization policy that is in use. We strengthen the privacy guarantee to defend against more realistic ¿policy-aware¿ attackers. We describe a polynomial algorithm to obtain an optimum anonymization policy. Our implementation and experiments show that the policy-aware sender k-anonymity has potential for practical impact, being efficiently enforceable, with limited reduction in utility when compared to policy-unaware guarantees.
Alin Deutsch, Richard Hull 0001, Avinash Vyas, Kevin Keliang Zhao
ICDE3
2005 Verification of Tree Updates for Optimization
Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas
CAV4
2005 Improving User Experience through Rule-based Service Customization
abstract
The web and converged services paradigm promises tremendous flexibility in the creation of rich composite services for enterprises and end users. The flexibility and richness offers the possibility of highly customized, individualized services for the end user and hence revenue generating services for service providers (e.g. ASPs, telecom network operators, ISPs). But how can end users (and enterprises) specify their preferences when a myriad of possibilities and potential circumstances need to be addressed? In this paper, we advocate a solution based on policy management where user preferences are specified through forms but translated into rules in a high-level policy language. This paper identifies the requirements for this kind of interpretation, and describes the Houdini system (developed at Bell Labs) which offers a rich rule-based language and a framework that supports intuitive, forms-based provisioning interfaces.
Richard Hull 0001, Bharat Kumar, Daniel F. Lieuwen, Peter F. Patel-Schneider, Arnaud Sahuguet, Sriram Varadarajan, Avinash Vyas
Int. J. Cooperative Inf. Syst.7
2004 Enabling Context-Aware and Privacy-Conscious User Data Sharing
abstract
This paper provides detail on two key components of the Houdini framework under development at Bell Labs, that enable context-aware and privacy-conscious user data sharing appropriate for mobile and/or ubiquitous computing. The framework includes an approach for integrating data from diverse sources, for gathering user preferences for what data to share and when to share it, and a policy management infrastructure in the network for enforcing those preferences. The current paper focuses on two components of this infrastructure that are essential for mobile and ubiquitous computing, namely the framework to support self-provisioning of preferences, and the performance of the underlying rules engine.
Richard Hull 0001, Bharat Kumar, Daniel F. Lieuwen, Peter F. Patel-Schneider, Arnaud Sahuguet, Sriram Varadarajan, Avinash Vyas
Mobile Data Management7
2003 "Everything Personal, Not Just Business: " Improving User Experience through Rule-Based Service Customization
Richard Hull 0001, Bharat Kumar, Daniel F. Lieuwen, Peter F. Patel-Schneider, Arnaud Sahuguet, Sriram Varadarajan, Avinash Vyas
ICSOC7