Yunior Ramírez-Cruz
This page was last updated on May 31st, 2021.
From June 2016 to May 2021, I was a Research Associate within the SaToSS research group at the University of Luxembourg. I was 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
- Private data analysis and data anonymisation:
- Privacy-preserving publication of social graphs
- Privacy-preserving social network analysis
- Trajectory anonymisation
- Natural language processing and text mining:
- Applications of NLP and text mining to security modelling, in particular attack tree construction
- Personalised document clustering
- Automatic summarisation
- Named-entity recognition and co-reference resolution
- Post-processing and validation of clustering algorithm outputs:
- Evaluation measures and meta-evaluation criteria for (co-)clustering algorithms
- Generation of cluster descriptions
- Graph theory:
- Resolvability
- Combinatorial optimisation methods on graphs
Project PrivDA
From June 1st, 2018, to May 31st, 2021, I led 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 aimed to provide methods for safely releasing privacy-sensitive structural information from dynamic social networks, accounting for, and counteracting, the presence of active adversaries, i.e. adversaries with the capability of enrolling fake users (also known as sybils) to interact with the network during the publication process. The project focused 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.
Additional details on this project can be found here.
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 semi-automatic attack tree construction.
Teaching
- Security Protocols, Master in Information and Computer Sciences, Fall 2018, 2019 and 2020
- Theoretical Computer Science 1*, Bachelor in Computer Science, Spring 2018, 2019, 2020 and 2021
- Automata and Formal Languages*, Bachelor in Applied Information Technology, Spring 2017