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

Linda Pareschi

dblp:96/4042 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 4 · 2 first-authorArtificial intelligence and machine learning · 1Security and privacy · 1Databases, data management, data science and information retrieval · 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
3 papers
Privacy and data protection · 75% Cryptographic primitives and cryptanalysis · 8% Network security · 8%
Human-computer interaction and pervasive computing
2 papers
Ubiquitous computing and smart environments · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 8 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
anonymization
0.222012
JS-Reduce: Defending Your Data from Sequential Background Knowledge Attacks · IEEE Trans. Dependable Secur. Comput. 2012
Composition and Generalization of Context Data for Privacy Preservation · PerCom 2008
Privacy and data protection › data publishing
privacy-preserving data publishing
0.112012
JS-Reduce: Defending Your Data from Sequential Background Knowledge Attacks · IEEE Trans. Dependable Secur. Comput. 2012
Privacy and data protection › data publishing
serial data publishing
0.112012
JS-Reduce: Defending Your Data from Sequential Background Knowledge Attacks · IEEE Trans. Dependable Secur. Comput. 2012
Privacy and data protection
anonymity
0.112008
Protecting Users' Anonymity in Pervasive Computing Environments · PerCom 2008
Cryptographic primitives and cryptanalysis
obfuscation
0.112008
Composition and Generalization of Context Data for Privacy Preservation · PerCom 2008
Security and privacy of machine learning › privacy attack
shadow attacks
0.112008
Protecting Users' Anonymity in Pervasive Computing Environments · PerCom 2008
Network security
traffic analysis
0.112008
Protecting Users' Anonymity in Pervasive Computing Environments · PerCom 2008
Ubiquitous computing and smart environments › context-aware computing
context-aware service provisioning
0.012008
Composition and Generalization of Context Data for Privacy Preservation · PerCom 2008

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

jensen-shannon divergence · 0.3simulation · 0.2semantic aggregation · 0.2middleware extension · 0.2defense techniques · 0.2
YearPublicationVenuePosition
2012 JS-Reduce: Defending Your Data from Sequential Background Knowledge Attacks
abstract
Web queries, credit card transactions, and medical records are examples of transaction data flowing in corporate data stores, and often revealing associations between individuals and sensitive information. The serial release of these data to partner institutions or data analysis centers in a nonaggregated form is a common situation. In this paper, we show that correlations among sensitive values associated to the same individuals in different releases can be easily used to violate users' privacy by adversaries observing multiple data releases, even if state-of-the-art privacy protection techniques are applied. We show how the above sequential background knowledge can be actually obtained by an adversary, and used to identify with high confidence the sensitive values of an individual. Our proposed defense algorithm is based on Jensen-Shannon divergence; experiments show its superiority with respect to other applicable solutions. To the best of our knowledge, this is the first work that systematically investigates the role of sequential background knowledge in serial release of transaction data.
Daniele Riboni, Linda Pareschi, Claudio Bettini
IEEE Trans. Dependable Secur. Comput.2
2011 Integrating Identity, Location, and Absence Privacy in Context-Aware Retrieval of Points of Interest
abstract
The retrieval of close-by points of interest (POIs) is becoming a popular location-based service (LBS), often integrated with navigational services and geo-social networks. However, the access to POI services is prone to potentially serious privacy issues, since requests for POIs often include sensitive information like the user's location and her personal interests. Many techniques to enforce privacy in LBS have been proposed in the literature, in some cases focusing on anonymizing the requests and in others on obfuscating information in order to decrease its sensitivity. In many cases privacy protection comes at some cost in terms of service precision and performance. In this paper we propose a novel technique that combines the above cited approaches, overcomes some of their limitations in terms of assumptions on adversary knowledge, while still guaranteeing service precision. Our privacy solution has been integrated in an existing distributed system to share and retrieve POIs based not only on the user's current location but also on other (possibly sensitive) context data.
Daniele Riboni, Linda Pareschi, Claudio Bettini
Mobile Data Management (1)2
2009 Preserving Anonymity of Recurrent Location-Based Queries
abstract
The anonymization of location based queries through the generalization of spatio-temporal information has been proposed as a privacy preserving technique. We show that the presence of multiple concurrent requests, the repetition of similar requests by the same issuers, and the distribution of different service parameters in the requests can significantly affect the level of privacy obtained by current anonymity-based techniques. We provide a formal model of the privacy threat, and we propose an incremental defense technique based on a combination of anonymity and obfuscation. We show the effectiveness of this technique by means of an extensive experimental evaluation.
Daniele Riboni, Linda Pareschi, Claudio Bettini, Sushil Jajodia
TIME2
2008 Composition and Generalization of Context Data for Privacy Preservation
abstract
This paper presents preliminary results on anonymization and obfuscation techniques to preserve users' privacy in context-aware service provisioning. The techniques are based on generalizing request parameters as well as the context data provided to the application. Local context semantic aggregation is used to improve the quality of service that can be achieved while preserving privacy. The paper also shows how the software architecture of the CARE middleware can be extended to implement the proposed techniques.
Linda Pareschi, Daniele Riboni, Alessandra Agostini, Claudio Bettini
PerCom1
2008 Protecting Users' Anonymity in Pervasive Computing Environments
abstract
The large scale adoption of adaptive services in pervasive and mobile computing is likely to be conditioned to the availability of reliable privacy-preserving technologies. Unfortunately, the research in this field can still be considered in its infancy. This paper considers a specific pervasive computing scenario, and shows that the application of state-of-the-art techniques for the anonymization of service requests is insufficient to protect the privacy of users. A specific class of attacks, called shadow attacks, is formally defined and a set of defense techniques is proposed. These techniques are validated through the use of a simulator and an extensive set of experiments.
Linda Pareschi, Daniele Riboni, Claudio Bettini
PerCom1
2008 Efficient profile aggregation and policy evaluation in a middleware for adaptive mobile applications
Claudio Bettini, Linda Pareschi, Daniele Riboni
Pervasive Mob. Comput.2
2008 Shadow attacks on users' anonymity in pervasive computing environments
Daniele Riboni, Linda Pareschi, Claudio Bettini
Pervasive Mob. Comput.2