Tristan Allard

dblp:05/1478 · DBLP profile ↗
← Back
18ranked-venue papers in the field
6as first author
8since 2021 · last 2026
0000-0002-2777-0027ORCID · verified

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 14 (5 first)Information Retrieval & Web Search · 4 (1 first)
YearPublicationVenuePosition
2026 Privacy Meets Regulations: Shaping the Future of Work
Mohammad Javad Amiri, Tristan Allard, Boon Thau Loo, Divyakant Agrawal, Amr El Abbadi
CIDR2
2026 CFDGraph: Privacy-Preserving Graph Processing for Large-Scale Collaborative Fraud Detection
abstract
International audience
Qiulin Wu, Amelie Chi Zhou, Tristan Allard, Shadi Ibrahim, Yuhong Feng, Lichun Li, Amr El Abbadi
ICDE3
2024 Synthetic Data: Generate Avatar Data on Demand
Thomas Lebrun, Louis Béziaud, Tristan Allard, Antoine Boutet, Sébastien Gambs, Mohamed Maouche
WISE (5)3
2023 SNAKE Challenge: Sanitization Algorithms under Attack
abstract
While there were already some privacy challenges organized in the domain of data sanitization, they have mainly focused on the defense side of the problem. To favor the organization of successful challenges focusing on attacks, we introduce the SNAKE framework that is designed to facilitate the organization of challenges dedicated to attacking existing data sanitization mechanisms. In particular, it enables to easily automate the redundant tasks that are inherent to any such challenge and exhibits the following salient features: genericity with respect to attacks, ease of use and extensibility. We propose to demonstrate the main features of the SNAKE framework through a specific instantiation focusing on membership inference attacks over differentially-private synthetic data generation schemes. This instance of the SNAKE framework is currently being used for supporting a challenge co-located with APVP 2023 (the French workshop on the protection of privacy).
Tristan Allard, Louis Béziaud, Sébastien Gambs
CIKM1
2022 PReVer: Towards Private Regulated Verified Data
abstract
International audience
Mohammad Javad Amiri, Tristan Allard, Divyakant Agrawal, Amr El Abbadi
EDBT2
2022 A Large-scale Empirical Analysis of Browser Fingerprints Properties for Web Authentication
abstract
Modern browsers give access to several attributes that can be collected to form a browser fingerprint. Although browser fingerprints have primarily been studied as a web tracking tool, they can contribute to improve the current state of web security by augmenting web authentication mechanisms. In this article, we investigate the adequacy of browser fingerprints for web authentication. We make the link between the digital fingerprints that distinguish browsers, and the biological fingerprints that distinguish Humans, to evaluate browser fingerprints according to properties inspired by biometric authentication factors. These properties include their distinctiveness, their stability through time, their collection time, their size, and the accuracy of a simple verification mechanism. We assess these properties on a large-scale dataset of 4,145,408 fingerprints composed of 216 attributes and collected from 1,989,365 browsers. We show that, by time-partitioning our dataset, more than 81.3% of our fingerprints are shared by a single browser. Although browser fingerprints are known to evolve, an average of 91% of the attributes of our fingerprints stay identical between two observations, even when separated by nearly six months. About their performance, we show that our fingerprints weigh a dozen of kilobytes and take a few seconds to collect. Finally, by processing a simple verification mechanism, we show that it achieves an equal error rate of 0.61%. We enrich our results with the analysis of the correlation between the attributes and their contribution to the evaluated properties. We conclude that our browser fingerprints carry the promise to strengthen web authentication mechanisms.
Nampoina Andriamilanto, Tristan Allard, Gaëtan Le Guelvouit, Alexandre Garel
ACM Trans. Web2
2021 FRESQUE: A Scalable Ingestion Framework for Secure Range Query Processing on Clouds
abstract
International audience
Hoang Van Tran, Tristan Allard, Laurent d'Orazio, Amr El Abbadi
EDBT2
2021 Separ: Towards Regulating Future of Work Multi-Platform Crowdworking Environments with Privacy Guarantees
abstract
Crowdworking platforms provide the opportunity for diverse workers to execute tasks for different requesters. The popularity of the ”gig” economy has given rise to independent platforms that provide competing and complementary services. Workers as well as requesters with specific tasks may need to work for or avail from the services of multiple platforms resulting in the rise of multi-platform crowdworking systems. Recently, there has been increasing interest by governmental, legal and social institutions to enforce regulations, such as minimal and maximal work hours, on crowdworking platforms. Platforms within multi-platform crowdworking systems, therefore, need to collaborate to enforce cross-platform regulations. While collaborating to enforce global regulations requires the transparent sharing of information about tasks and their participants, the privacy of all participants needs to be preserved. In this paper, we propose an overall vision exploring the regulation, privacy, and architecture dimensions for the future of work multi-platform crowdworking environments. We then present Separ, a multi-platform crowdworking system that enforces a large sub-space of practical global regulations on a set of distributed independent platforms in a privacy-preserving manner. Separ, enforces privacy using lightweight and anonymous tokens, while transparency is achieved using fault-tolerant blockchain ledgers shared among multiple platforms. The privacy guarantees of Separ against covert adversaries are formalized and thoroughly demonstrated, while the experiments reveal the efficiency of Separ in terms of performance and scalability.
Mohammad Javad Amiri, Joris Duguépéroux, Tristan Allard, Divyakant Agrawal, Amr El Abbadi
WWW3
2020 Task-Tuning in Privacy-Preserving Crowdsourcing Platforms
abstract
International audience
Joris Duguépéroux, Antonin Voyez, Tristan Allard
EDBT3
2019 Range Query Processing for Monitoring Applications over Untrustworthy Clouds
abstract
International audience
Hoang Van Tran, Tristan Allard, Laurent d'Orazio, Amr El Abbadi
EDBT2
2018 A Differentially Private Index for Range Query Processing in Clouds
abstract
Performing non-aggregate range queries on cloud stored data, while achieving both privacy and efficiency is a challenging problem. This paper proposes constructing a differentially private index to an outsourced encrypted dataset. Efficiency is enabled by using a cleartext index structure to perform range queries. Security relies on both differential privacy (of the index) and semantic security (of the encrypted dataset). Our solution, PINED-RQ develops algorithms for building and updating the differentially private index. Compared to state-of-the-art secure index based range query processing approaches, PINED-RQ executes queries in the order of at least one magnitude faster. The security of PINED-RQ is proved and its efficiency is assessed by an extensive experimental validation.
Cetin Sahin, Tristan Allard, Reza Akbarinia, Amr El Abbadi, Esther Pacitti
ICDE2
2017 Lightweight Privacy-Preserving Task Assignment in Skill-Aware Crowdsourcing
Louis Béziaud, Tristan Allard, David Gross-Amblard
DEXA (2)2
2016 A new privacy-preserving solution for clustering massively distributed personal times-series
abstract
New personal data fields are currently emerging due to the proliferation of on-body/at-home sensors connected to personal devices. However, strong privacy concerns prevent individuals to benefit from large-scale analytics that could be performed on this fine-grain highly sensitive wealth of data. We propose a demonstration of Chiaroscuro, a complete solution for clustering massively-distributed sensitive personal data while guaranteeing their privacy. The demonstration scenario highlights the affordability of the privacy vs. quality and privacy vs. performance tradeoffs by dissecting the inner working of Chiaroscuro - launched over energy consumption times-series -, by exposing the results obtained by the individuals participating in the clustering process, and by illustrating possible uses.
Tristan Allard, Georges Hébrail, Florent Masseglia, Esther Pacitti
ICDE1
2015 Chiaroscuro: Transparency and Privacy for Massive Personal Time-Series Clustering
abstract
The advent of on-body/at-home sensors connected to personal devices leads to the generation of fine grain highly sensitive personal data at an unprecendent rate. However, despite the promises of large scale analytics there are obvious privacy concerns that prevent individuals to share their personnal data. In this paper, we propose Chiaroscuro, a complete solution for clustering personal data with strong privacy guarantees. The execution sequence produced by Chiaroscuro is massively distributed on personal devices, coping with arbitrary connections and disconnections. Chiaroscuro builds on our novel data structure, called Diptych, which allows the participating devices to collaborate privately by combining encryption with differential privacy. Our solution yields a high clustering quality while minimizing the impact of the differentially private perturbation. Chiaroscuro is both correct and secure. Finally, we provide an experimental validation of our approach on both real and synthetic sets of time-series.
Tristan Allard, Georges Hébrail, Florent Masseglia, Esther Pacitti
SIGMOD Conference1
2014 METAP: revisiting Privacy-Preserving Data Publishing using secure devices
Tristan Allard, Benjamin Nguyen, Philippe Pucheral
Distributed Parallel Databases1
2011 Towards a Safe Realization of Privacy-Preserving Data Publishing Mechanisms
abstract
This article addresses the issue of adapting the traditional model of Privacy-Preserving Data Publishing (PPDP) to an environment composed of a large number of tamper-resistant Secure Portable Tokens (SPTs) containing private personal data. Our model assumes that the SPTs seldom connect to a highly available but untrusted infrastructure. We illustrate the problem by studying the feasability of the simple generalization privacy mechanism to enforce k-anonymity.
Tristan Allard, Benjamin Nguyen, Philippe Pucheral
Mobile Data Management (2)1
2010 Secure Personal Data Servers: a Vision Paper
abstract
An increasing amount of personal data is automatically gathered and stored on servers by administrations, hospitals, insurance companies, etc. Citizen themselves often count on internet companies to store their data and make them reliable and highly available through the internet. However, these benefits must be weighed against privacy risks incurred by centralization. This paper suggests a radically different way of considering the management of personal data. It builds upon the emergence of new portable and secure devices combining the security of smart cards and the storage capacity of NAND Flash chips. By embedding a full-fledged Personal Data Server in such devices, user control of how her sensitive data is shared by others (by whom, for how long, according to which rule, for which purpose) can be fully reestablished and convincingly enforced. To give sense to this vision, Personal Data Servers must be able to interoperate with external servers and must provide traditional database services like durability, availability, query facilities, transactions. This paper proposes an initial design for the Personal Data Server approach, identifies the main technical challenges associated with it and sketches preliminary solutions. We expect that this paper will open exciting perspectives for future database research.
Tristan Allard, Nicolas Anciaux, Luc Bouganim, Yanli Guo, Lionel Le Folgoc, Benjamin Nguyen, Philippe Pucheral, Indrajit Ray, Indrakshi Ray, Shaoyi Yin
Proc. VLDB Endow.1
2008 WebContent: efficient P2P Warehousing of web data
abstract
We present the WebContent platform for managing distributed repositories of XML and semantic Web data. The platform allows integrating various data processing building blocks (crawling, translation, semantic annotation, full-text search, structured XML querying, and semantic querying), presented as Web services, into a large-scale efficient platform. Calls to various services are combined inside ActiveXML [8] documents, which are XML documents including service calls. An ActiveXML optimizer is used to: ( i ) efficiently distribute computations among sites; ( ii ) perform XQuery-specific optimizations by leveraging an algebraic XQuery optimizer; and ( iii ) given an XML query, chose among several distributed indices the most appropriate in order to answer the query.
Serge Abiteboul, Tristan Allard, Philippe Chatalic, Georges Gardarin, A. Ghitescu, François Goasdoué, Ioana Manolescu, Benjamin Nguyen, M. Ouazara, A. Somani, Nicolas Travers, Gabriel Vasile, Spyros Zoupanos
Proc. VLDB Endow.2