Nataliia Bielova
French Institute for Research in Computer Science and Automation
62 Papers
344 Citations
Nataliia Bielova is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Computer science & Data Protection Act 1998. The author has an hindex of 17, co-authored 57 publications. Previous affiliations of Nataliia Bielova include University of Nice Sophia Antipolis & University of Trento.
Chat about Author
Papers
•Posted Content
Consent Management Platforms under the GDPR: processors and/or controllers?
TL;DR: In this paper, the authors perform empirical experiments with two major CMP providers in the EU: Quantcast and OneTrust and paired with a legal analysis and conclude that CMPs process personal data.
19
Towards Practical Enforcement Theories
Nataliia Bielova,Fabio Massacci,Andrea Micheletti +2 more
- 30 Sep 2009
TL;DR: A set of policies called iterative properties that revises the notion of good traces in terms of repeated iterations are explored, discussing how an enforcement mechanism can actually deal with bad executions (and not just only the good ones).
Proximity Tracing Approaches - Comparative Impact Analysis
Antoine Boutet,Nataliia Bielova,Claude Castelluccia,Mathieu Cunche,Cédric Lauradoux,Daniel Le Métayer,Vincent Roca +6 more
- 30 Apr 2020
TL;DR: The goal of this document is to analyze the impact of the so-called “centralized" and “decentralized” approaches to COVID-19 proximity tracing in terms of privacy, security and reliability.
18
Spot the Difference: Secure Multi-execution and Multiple Facets
Nataliia Bielova,Tamara Rezk +1 more
- 26 Sep 2016
TL;DR: A rigorous comparison of two widely known dynamic information flow mechanisms: Secure Multi-Execution (SME) and Multiple Facets (MF) is proposed.
Iterative enforcement by suppression: Towards practical enforcement theories
Nataliia Bielova,Fabio Massacci +1 more
TL;DR: This paper proposes an enforcement mechanism that can deal with bad executions and not only the good ones in a more predictable way by eliminating bad iterations by revising the notion of good executions in terms of repeated iterations.