I am a Research Associate within the
SaToSS research group
at the
University of Luxembourg.
I am also a member of
SnT
(Interdisciplinary Centre for Security, Reliability and Trust). I hold Bachelor and Master's degrees in Computer Science
from
Universidad de Oriente, Cuba,
and a PhD in Computer Engineering and Mathematics
from
Universitat Rovira i Virgili, Spain.
Research interests
- Privacy in social networks:
- Privacy-preserving publication of social graphs
- Privacy-preserving social network analysis
- Graph theory:
- Resolvability
- Combinatorial optimization methods on graphs
- Natural language processing and text mining:
- At SaToSS:
- Applications of information extraction techniques to security modeling, in particular attack tree construction
- Applications of NLP and social network analysis to digital forensics,
in particular the detection of evidence destruction in corporate
e-mail servers
- Previously:
- Personalized document clustering
- Automatic summarization
- Named-entity recognition
- Co-reference resolution
- Data mining:
- Evaluation measures and meta-evaluation criteria for clustering algorithms
Project PrivDA
Since June 1st, 2018, I am acting as Principal Investigator of the research project PrivDA
(Privacy-preserving Publication of Dynamic Social Network Data in the Presence of Active Adversaries),
funded by Luxembourg's Fonds National de la Recherche, under the CORE program, junior track,
Ref. No. C17/IS/11685812.
PrivDA aims to provide methods for safely releasing structural information about dynamic social networks,
accounting for, and counteracting, the presence of active adversaries, i.e. adversaries with the capability
of interacting with the network during the publication process. The project focuses on studying
how the dynamic nature of the networks and the release process can be exploited by active adversaries,
as well as defining novel ways to quantify privacy in the dynamic scenario and proposing new models and algorithms
to enable social network owners to safely release information in two manners: (1) periodically publishing
anonymised versions of the underlying dynamic social graph, and (2) answering structural queries about the network.
Click here for additional details on this project.
Other projects
- DIST (Distance bounding: a graph theoretical and formal approach), funded by FNR
(CORE program, Ref. No. C15/IS/10428112) and led by Dr. Rolando Trujillo-Rasua.
My work consisted in searching for optimal graph-based distance bounding protocols,
in terms of resistance to mafia fraud.
- ADT2P (Attack-Defense Trees: Theory Meets Practice), funded by FNR
(CORE program, Ref. No. C13/IS/5809105) and led by Prof. Dr. Sjouke Mauw.
My work consisted in applying NLP and text mining techniques to attack tree construction.
Teaching
- Security Protocols, Master
in Information and Computer Sciences, Fall 2018, 2019, 2020
- Theoretical Computer Science 1*, Bachelor
in Computer Science, Spring 2018, 2019, 2020
- Automata and Formal Languages*, Bachelor
in Applied Information Technology, Spring 2017
*
The course Theoretical Computer Science 1 is an extended, more in-depth version of the course Automata and Formal Languages