I am a PhD Student at the K-riptography and Information Security for Open Networks (KISON) research group at Universitat Oberta de Catalunya (UOC). I hold a double BSc on Mathematics and Computer Science by the Universitat de Barcelona (UB). I also have a MSc on Fundamental Principles of Data Science by UB aswell.
My research interests are on cryptography and blockchain. In particular, I am interested on blockchain security assumptions, and on the use of Zero-Knowledge Proofs to scale blockchains.
PhD in Cryptography and Blockchain, 2021 - Present
Universitat Oberta de Catalunya
MSc in Fundamental Principles of Data Science, 2020 - 2021
Universitat de Barcelona
Double BSc in Mathematics and Computer Science, 2013 - 2020
Universitat de Barcelona
Since the creation of Bitcoin, back in 2009, many other cryptocurrencies have appear, and its usage has been growing year after year. With this huge popularity, doubts about the ability of blockchains to become worldwide payment systems (or even universal mediums for general decentralised systems) begin to arise and, with them, solutions started to be explored. In this paper we first explain the blockchain scalability problem and then present a brief review and a comparison among some of the state-of-the-art techniques that are used to scale blockchains on Layer 2 (or off-chain), analysing properties related to their Usability, Security and Cost.
Multivariate hierarchical data has an important role in many applications. To find the best visualisation that best fits a concrete data is crucial to explore and understand the relationships between the data. This paper proposes a categorisation – Elongated and Compact – of hierarchical data based on the inner shapes of the hierarchies, that is the connectivity degree of the internal nodes, the number of nodes, etc, that can be applied to any hierarchical data. Based on this taxonomy, we explore implicit and explicit layouts – Tree, Circle Packing, Force and Radial – to provide users with a complete view of the data. We hypothesise that Tree and Circle Packing fit with Elongated structures, and Force and Radial fit with Compact ones. In addition, we cluster multivariate features to embed them in the hierarchical layouts. Especially, we propose two different glyphs –one-by-one and all-in-one, and we bet for the one-by-one glyphs as the most suitable for showing the distribution of several features along with the hierarchical structures. To validate our hypotheses, we conducted a user study with 35 participants using a hate speech annotated corpus. This corpus comes from 4359 comments posted in online Spanish newspapers. The results indicated that users preferred the Tree layout over the other three layouts (Circle, Force, Radial) with both types of structures (EC and CC). However, when we focused the analysis only on Radial and Force layouts, both of them scored significantly higher with Compact than with Elongated data. Moreover, participants scored the one-by-one glyph higher than the all-in-one glyph, but the difference was not significant.
Ping me on Telegram or send me an email!